A note on small directed graphs as neighborhood graphs
Salar Y. Alsardary (1994)
Czechoslovak Mathematical Journal
Similarity:
Displaying similar documents to “Partially directed Moore graphs”
A note on small directed graphs as neighborhood graphs
On partially directed -graphs
Pavol Híc (1984)
Mathematica Slovaca
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.