Displaying similar documents to “On the symmetry of the distribution of k -crossings and k -nestings in graphs.”

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.

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: