Displaying similar documents to “On the recognition of bipolarizable and P 4 -simplicial 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.

Randomly H graphs

Gary Chartrand, Ortrud R. Oellermann, Sergio Ruiz (1986)

Mathematica Slovaca

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

Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs

Pablo De Caria, Terry A. McKee (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations. More intriguingly, these characterizations of chordal graphs can be naturally strengthened to new characterizations of strongly chordal graphs