Cordial deficiency.
Riskin, Adrian (2007)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Displaying similar documents to “On universal cycles of labeled graphs.”
Cordial deficiency.
On the recognition of bipolarizable and -simplicial graphs.
Nikolopoulos, Stavros D., Palios, Leonidas (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Natural bijections between directed and undirected self-complementary graphs
Bohdan Zelinka (1987)
Mathematica Slovaca
Similarity:
The -labeling on total graphs of complete multipartite graphs.
Marinescu-Ghemeci, Ruxandra, Mihai, Gabriela (2011)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
The distance between various orientations of a graph
Bohdan Zelinka (1988)
Mathematica Slovaca
Similarity:
The complexity of obtaining a distance-balanced graph.
Cabello, Sergio, Lukšič, Primož (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Heavy Subgraph Conditions for Longest Cycles to Be Heavy in Graphs
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...