Old and new generalizations of line graphs.
Bagga, Jay (2004)
International Journal of Mathematics and Mathematical Sciences
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.
Displaying similar documents to “Extension of -labelings of quadratic graphs.”
Old and new generalizations of line graphs.
On -closed graphs
Pavel Tomasta, Eliška Tomová (1988)
Czechoslovak Mathematical Journal
Similarity:
The adjacency graphs of a complex
A. K. Dewdney, Frank Harary (1976)
Czechoslovak Mathematical Journal
Similarity:
Supermagic Graphs Having a Saturated Vertex
Jaroslav Ivančo, Tatiana Polláková (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A graph is called supermagic if it admits a labeling of the edges by pairwise different consecutive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. In this paper we establish some conditions for graphs with a saturated vertex to be supermagic. Inter alia we show that complete multipartite graphs K1,n,n and K1,2,...,2 are supermagic.
Edge rotations and distance between graphs
Gary Chartrand, Farrokh Saba, Hung Bin Zou (1985)
Časopis pro pěstování matematiky
Similarity:
A note on outerplanarity of product graphs
P K. Jha, G Slutzki (1991)
Applicationes Mathematicae
Similarity: