Geodesic
A note on strongly multiplicative graphs
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 1, pp. 81-83.

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 bound obtained by Beineke and Hegde [1].
Keywords: graph labeling, strongly multiplicative graphs 
@article{DMGT_2004_24_1_a6,
     author = {Adiga, Chandrashekar and Ramaswamy, H. and Somashekara, D.},
     title = {A note on strongly multiplicative graphs},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {81--83},
     publisher = {mathdoc},
     volume = {24},
     number = {1},
     year = {2004},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a6/}
}
TY  - JOUR
AU  - Adiga, Chandrashekar
AU  - Ramaswamy, H.
AU  - Somashekara, D.
TI  - A note on strongly multiplicative graphs
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2004
SP  - 81
EP  - 83
VL  - 24
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a6/
LA  - en
ID  - DMGT_2004_24_1_a6
ER  - 
%0 Journal Article
%A Adiga, Chandrashekar
%A Ramaswamy, H.
%A Somashekara, D.
%T A note on strongly multiplicative graphs
%J Discussiones Mathematicae. Graph Theory
%D 2004
%P 81-83
%V 24
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a6/
%G en
%F DMGT_2004_24_1_a6
Adiga, Chandrashekar; Ramaswamy, H.; Somashekara, D. A note on strongly multiplicative graphs. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 1, pp. 81-83. http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a6/

[1] L.W. Beineke and S.M. Hegde, Strongly multiplicative graphs, Discuss. Math. Graph Theory 21 (2001) 63-76, doi: 10.7151/dmgt.1133.

[2] P. Erdős, An asymptotic inequality in the theory of numbers, Vestnik Leningrad, Univ. 15 (1960) 41-49.