Displaying similar documents to “On the basis number of the corona of graphs.”

Randomly H graphs

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

Mathematica Slovaca

Similarity:

Characterization of semientire graphs with crossing number 2

D. G. Akka, J. K. Bano (2002)

Mathematica Bohemica

Similarity:

The purpose of this paper is to give characterizations of graphs whose vertex-semientire graphs and edge-semientire graphs have crossing number 2. In addition, we establish necessary and sufficient conditions in terms of forbidden subgraphs for vertex-semientire graphs and edge-semientire graphs to have crossing number 2.

On H -closed graphs

Pavel Tomasta, Eliška Tomová (1988)

Czechoslovak Mathematical Journal

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