The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Graphs having planar complementary line (total) graphs.”

On H -closed graphs

Pavel Tomasta, Eliška Tomová (1988)

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.