A note on strongly multiplicative graphs

Chandrashekar Adiga, H.N. Ramaswamy, and D.D. Somashekara. "A note on strongly multiplicative graphs." Discussiones Mathematicae Graph Theory 24.1 (2004): 81-83. <http://eudml.org/doc/270657>.

@article{ChandrashekarAdiga2004,
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 bound obtained by Beineke and Hegde [1].},
author = {Chandrashekar Adiga, H.N. Ramaswamy, D.D. Somashekara},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {graph labeling; strongly multiplicative graphs; strongly multiplicative graph},
language = {eng},
number = {1},
pages = {81-83},
title = {A note on strongly multiplicative graphs},
url = {http://eudml.org/doc/270657},
volume = {24},
year = {2004},
}

TY - JOUR
AU - Chandrashekar Adiga
AU - H.N. Ramaswamy
AU - D.D. Somashekara
TI - A note on strongly multiplicative graphs
JO - Discussiones Mathematicae Graph Theory
PY - 2004
VL - 24
IS - 1
SP - 81
EP - 83
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 bound obtained by Beineke and Hegde [1].
LA - eng
KW - graph labeling; strongly multiplicative graphs; strongly multiplicative graph
UR - http://eudml.org/doc/270657
ER -