Characterizing symmetric diametrical graphs of order 12 and diameter 4.
Al-Addasi, S., Al-Ezeh, H. (2002)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Al-Addasi, S., Al-Ezeh, H. (2002)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Pavol Híc (1989)
Mathematica Slovaca
Similarity:
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.
Bohdan Zelinka (1984)
Časopis pro pěstování matematiky
Similarity:
Lowell W. Beineke, Gary Chartrand (1968)
Compositio Mathematica
Similarity: