Voltage graphs, group presentations and cages.
Exoo, Geoffrey (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Exoo, Geoffrey (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nikoghosyan, Zh.G. (2011)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Thatte, Bhalchandra D. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hoffman, F., Locke, S.C., Meyerowitz, A.D. (1991)
Mathematica Pannonica
Similarity:
McKee, Terry A. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zofia Majcher (1987)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Plantholt, Michael J., Tipnis, Shailesh K. (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Binlong Lia, Shenggui Zhang (2016)
Discussiones Mathematicae Graph Theory
Similarity:
Let G be a graph on n vertices. A vertex of G with degree at least n/2 is called a heavy vertex, and a cycle of G which contains all the heavy vertices of G is called a heavy cycle. In this note, we characterize graphs which contain no heavy cycles. For a given graph H, we say that G is H-heavy if every induced subgraph of G isomorphic to H contains two nonadjacent vertices with degree sum at least n. We find all the connected graphs S such that a 2-connected graph G being S-heavy implies...
Acharya, B.Devadas, Acharya, Mukti, Sinha, Deepa (2009)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Boben, Marko, Miklavic, Stefko, Potocnik, Primoz (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity: