Super mean number of a graph
A. Nagarajan, R. Vasuki, S. Arockiaraj (2012)
Kragujevac Journal of Mathematics
Similarity:
Displaying similar documents to “-Geometric Mean Labeling of some Chain Graphs and Thorn graphs”
Super mean number of a graph
Elevation of a graph
Ľudovít Niepel, Pavel Tomasta (1981)
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.
Characterization of a signed graph whose signed line graph is -consistent.
Acharya, B.Devadas, Acharya, Mukti, Sinha, Deepa (2009)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Nullity of Graphs: An Updated Survey
Ivan Gutman, Bojana Borovićanin (2011)
Zbornik Radova
Similarity:
On magic joins of graphs
Jaroslav Ivančo, Tatiana Polláková (2012)
Mathematica Bohemica
Similarity:
A graph is called magic (supermagic) if it admits a labeling of the edges by pairwise different (and 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 characterize magic joins of graphs and we establish some conditions for magic joins of graphs to be supermagic.
Extension of -labelings of quadratic graphs.
Eshghi, Kourosh (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
On the Total Graph of Mycielski Graphs, Central Graphs and Their Covering Numbers
H.P. Patil, R. Pandiya Raj (2013)
Discussiones Mathematicae Graph Theory
Similarity:
The technique of counting cliques in networks is a natural problem. In this paper, we develop certain results on counting of triangles for the total graph of the Mycielski graph or central graph of star as well as completegraph families. Moreover, we discuss the upper bounds for the number of triangles in the Mycielski and other well known transformations of graphs. Finally, it is shown that the achromatic number and edge-covering number of the transformations mentioned above are equated. ...