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

• Autorzy: Chandrashekar Adiga , Mahadev Smitha
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

graph labelling; strongly multiplicative graphs

Kategorie tematyczne

• 05C78: Graph labelling (graceful graphs, bandwidth, etc.)

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2006
• Tom: 26
• Numer: 2
• Strony: 225-229

Daty

wydano

2006

otrzymano

2005-08-18

poprawiono

2005-12-29

Twórcy

autor

Chandrashekar Adiga

• Department of Studies in Mathematics, University of Mysore, Manasagangotri, Mysore-570006, India

autor

Mahadev Smitha

• Department of Mathematics, Sri Jayachamarajendra College of Engineering, Mysore-570006, India

Bibliografia

• [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.
• [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.
• [3] L.W. Beineke and S.M. Hegde, Strongly multiplicative graphs, Discuss. Math. Graph Theory 21 (2001) 63-76, doi: 10.7151/dmgt.1133.
• [4] P. Erdős, An asymptotic inequality in the theory of numbers, Vestnik Leningrad. Univ. 15 (1960) 41-49.

Identyfikatory

DOI

10.7151/dmgt.1315