Open AccessStrongly Multiplicative Labeling for Some Cycle Related Graphs
Author(s) -
S. K. Vaidya,
K K Kanani
Publication year - 2010
Publication title -
modern applied science
Language(s) - English
Resource type - Journals
eISSN - 1913-1852
pISSN - 1913-1844
DOI - 10.5539/mas.v4n7p82
Subject(s) - multiplicative function , combinatorics , mathematics , chord (peer to peer) , chordal graph , discrete mathematics , graph , computer science , mathematical analysis , distributed computing
In this paper we discuss strongly multiplicative labeling of some cycle related graphs. We prove that cycle with one chord, cycle with twin chords and cycle with triangle are strongly multiplicative graphs. In addition to this we prove that the graphs obtained by fusion and duplication of vertices in cycle admit strongly multiplicative labeling.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom