Geodesic
An upper bound for maximum number of edges in a strongly multiplicative graph
Discussiones Mathematicae. Graph Theory, Tome 26 (2006) no. 2, pp. 225-229

Voir la notice de l'article provenant de la source Library of Science

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.
Keywords: graph labelling, strongly multiplicative graphs 
@article{DMGT_2006_26_2_a4,
     author = {Adiga, Chandrashekar and Smitha, Mahadev},
     title = {An upper bound for maximum number of edges in a strongly multiplicative graph},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {225--229},
     publisher = {mathdoc},
     volume = {26},
     number = {2},
     year = {2006},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2006_26_2_a4/}
}
TY  - JOUR
AU  - Adiga, Chandrashekar
AU  - Smitha, Mahadev
TI  - An upper bound for maximum number of edges in a strongly multiplicative graph
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2006
SP  - 225
EP  - 229
VL  - 26
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2006_26_2_a4/
LA  - en
ID  - DMGT_2006_26_2_a4
ER  - 
%0 Journal Article
%A Adiga, Chandrashekar
%A Smitha, Mahadev
%T An upper bound for maximum number of edges in a strongly multiplicative graph
%J Discussiones Mathematicae. Graph Theory
%D 2006
%P 225-229
%V 26
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2006_26_2_a4/
%G en
%F DMGT_2006_26_2_a4
Adiga, Chandrashekar; Smitha, Mahadev. An upper bound for maximum number of edges in a strongly multiplicative graph. Discussiones Mathematicae. Graph Theory, Tome 26 (2006) no. 2, pp. 225-229. http://geodesic.mathdoc.fr/item/DMGT_2006_26_2_a4/