An upper bound for maximum number of edges in a strongly multiplicative graph
Chandrashekar Adiga; Mahadev Smitha
Discussiones Mathematicae Graph Theory (2006)
- Volume: 26, Issue: 2, page 225-229
- ISSN: 2083-5892
Access Full Article
topAbstract
topHow to cite
topReferences
top- [1] C. Adiga, H.N. Ramaswamy and D.D. Somashekara, On strongly multiplicative graphs, South East Asian J. Math. & Math. Sc. 2 (2003) 45-47. Zbl1050.05106
- [2] C. Adiga, H.N. Ramaswamy and D.D. Somashekara, A note on strongly multiplicative graphs, Discuss. Math. Graph Theory 24 (2004) 81-83, doi: 10.7151/dmgt.1215. Zbl1057.05072
- [3] L.W. Beineke and S.M. Hegde, Strongly multiplicative graphs, Discuss. Math. Graph Theory 21 (2001) 63-76, doi: 10.7151/dmgt.1133. Zbl0989.05101
- [4] P. Erdős, An asymptotic inequality in the theory of numbers, Vestnik Leningrad. Univ. 15 (1960) 41-49. Zbl0104.26804