The edge-count criterion for graphic lists.
Isaak, Garth, West, Douglas B. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the symmetry of the distribution of -crossings and -nestings in graphs.”
The edge-count criterion for graphic lists.
On independent vertices and edges of belt graphs.
Gutman, I. (1996)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Graphs having planar complementary line (total) graphs.
Simic, Slobodan K. (1981)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Uniqueness of graph square roots of girth six.
Adamaszek, Anna, Adamaszek, Michał (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multiprocessor Interconnection Networks
Dragoš Cvetković, Tatjana Davidović (2011)
Zbornik Radova
Similarity:
Magic and supermagic dense bipartite graphs
Jaroslav Ivanco (2007)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called magic (supermagic) if it admits a labelling of the edges by pairwise different (and consecutive) positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In the paper we prove that any balanced bipartite graph with minimum degree greater than |V(G)|/4 ≥ 2 is magic. A similar result is presented for supermagic regular bipartite graphs.
Graphs with prescribed size and vertex parities
Philip J. Pratt, Donald W. Vanderjagt (1977)
Colloquium Mathematicae
Similarity:
The Smallest Non-Autograph
Benjamin S. Baumer, Yijin Wei, Gary S. Bloom (2016)
Discussiones Mathematicae Graph Theory
Similarity:
Suppose that G is a simple, vertex-labeled graph and that S is a multiset. Then if there exists a one-to-one mapping between the elements of S and the vertices of G, such that edges in G exist if and only if the absolute difference of the corresponding vertex labels exist in S, then G is an autograph, and S is a signature for G. While it is known that many common families of graphs are autographs, and that infinitely many graphs are not autographs, a non-autograph has never been exhibited....
A metric for graphs
Vladimír Baláž, Jaroslav Koča, Vladimír Kvasnička, Milan Sekanina (1986)
Časopis pro pěstování matematiky
Similarity: