Abstract
Let be a graph and be an injection. For each edge , the induced edge labeling is defined as . Then is called a super geometric mean labeling if . A graph that admits a super geometric mean labeling is called a super geometric mean graph. In this paper, we discuss the super geometric meanness of union of any paths, union of any cycles of order , the graph for , square graph, total graph, the -graph, the graph and for any -graph , subdivision of and some chain graphs.
Acknowledgments
The authors would like to thank the editor and anonymous reviewers for helpful suggestions which improved the presentation of the paper.
Citation
A. Durai Baskar. S. Arockiaraj. "Super geometric mean graphs." SUT J. Math. 52 (2) 97 - 116, December 2016. https://doi.org/10.55937/sut/1483718462
Information