A note on strongly multiplicative graphs

• Autorzy: Chandrashekar Adiga , H.N. Ramaswamy , D.D. Somashekara
• 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 bound obtained by Beineke and Hegde [1].

Słowa kluczowe

EN

graph labeling; strongly multiplicative graphs

Kategorie tematyczne

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

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2004
• Tom: 24
• Numer: 1
• Strony: 81-83

Daty

wydano

2004

otrzymano

2001-10-24

poprawiono

2002-07-06

Twórcy

autor

Chandrashekar Adiga

• Department of Studies in Mathematics, University of Mysore, Manasagangotri, Mysore - 570 006, INDIA

autor

H.N. Ramaswamy

• Department of Studies in Mathematics, University of Mysore, Manasagangotri, Mysore - 570 006, INDIA

autor

D.D. Somashekara

• Department of Studies in Mathematics, University of Mysore, Manasagangotri, Mysore - 570 006, INDIA

Bibliografia

• [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.

Identyfikatory

DOI

10.7151/dmgt.1215