# 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

top## Abstract

top## How to cite

topChandrashekar Adiga, and Mahadev Smitha. "An upper bound for maximum number of edges in a strongly multiplicative graph." Discussiones Mathematicae Graph Theory 26.2 (2006): 225-229. <http://eudml.org/doc/270243>.

@article{ChandrashekarAdiga2006,

abstract = {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.},

author = {Chandrashekar Adiga, Mahadev Smitha},

journal = {Discussiones Mathematicae Graph Theory},

keywords = {graph labelling; strongly multiplicative graphs; strongly multiplicative graph},

language = {eng},

number = {2},

pages = {225-229},

title = {An upper bound for maximum number of edges in a strongly multiplicative graph},

url = {http://eudml.org/doc/270243},

volume = {26},

year = {2006},

}

TY - JOUR

AU - Chandrashekar Adiga

AU - Mahadev Smitha

TI - An upper bound for maximum number of edges in a strongly multiplicative graph

JO - Discussiones Mathematicae Graph Theory

PY - 2006

VL - 26

IS - 2

SP - 225

EP - 229

AB - 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.

LA - eng

KW - graph labelling; strongly multiplicative graphs; strongly multiplicative graph

UR - http://eudml.org/doc/270243

ER -

## References

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

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.