An upper bound for maximum number of edges in a strongly multiplicative graph
Chandrashekar Adiga, Mahadev Smitha · Discussiones Mathematicae Graph Theory · 2006
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 bounds given by Beineke and Hegde [3] and Adiga, Ramaswamy and Somashekara [2], for n ∏ 28.