On independent vertices and edges of belt graphs.

Gutman, I.

Displaying similar documents to “On independent vertices and edges of belt graphs.”

Gallai and anti-Gallai graphs of a graph

S. Aparna Lakshmanan, S. B. Rao, A. Vijayakumar (2007)

Mathematica Bohemica

Similarity:

The paper deals with graph operators—the Gallai graphs and the anti-Gallai graphs. We prove the existence of a finite family of forbidden subgraphs for the Gallai graphs and the anti-Gallai graphs to be $H$ -free for any finite graph $H$ . The case of complement reducible graphs—cographs is discussed in detail. Some relations between the chromatic number, the radius and the diameter of a graph and its Gallai and anti-Gallai graphs are also obtained.

Graphs having planar complementary line (total) graphs.

Simic, Slobodan K. (1981)

Publications de l'Institut Mathématique. Nouvelle Série

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....