A note on strongly multiplicative graphs
Chandrashekar Adiga, H.N. Ramaswamy, D.D. Somashekara (2004)
Discussiones Mathematicae Graph Theory
Similarity:
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bound obtained by Beineke and Hegde [1].