Dual approach to edge distance between graphs
Vladimír Baláž, Vladimír Kvasnička, Jiří Pospíchal (1989)
Časopis pro pěstování matematiky
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.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A metric for graphs”
Dual approach to edge distance between graphs
On a maximal distance between graphs
Michal Šabo (1991)
Czechoslovak Mathematical Journal
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.
All Ramsey numbers for connected graphs of order 9.
Brandt, Stephan, Brinkmann, Gunnar, Harmuth, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graphs having planar complementary line (total) graphs.
Simic, Slobodan K. (1981)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Distinguishing graphs by the number of homomorphisms
Steve Fisk (1995)
Discussiones Mathematicae Graph Theory
Similarity:
A homomorphism from one graph to another is a map that sends vertices to vertices and edges to edges. We denote the number of homomorphisms from G to H by |G → H|. If 𝓕 is a collection of graphs, we say that 𝓕 distinguishes graphs G and H if there is some member X of 𝓕 such that |G → X | ≠ |H → X|. 𝓕 is a distinguishing family if it distinguishes all pairs of graphs. We show that various collections of graphs are a distinguishing family.