Strongly multiplicative labeling of some standard graphs

K K Kanani, T M Chhaya

Abstract


In this paper we investigate strongly multiplicative labeling of some standard graphs. We prove that helm, flower graph, fan, friendship graph and bistar are strongly multiplicative. We also prove that gear graph, double triangular snake, double fan and double wheel are strongly multiplicative.

Full Text:

PDF

References


L W Beineke and S M Hegde, Strongly multiplicative graphs, Discus-siones Mathematicae Graph Theory, 21(2001), 63-75.

J A Gallian, A dynamic survey of graph labeling, The Electronics Journal of Combinatorics, 18(2015).

K K Kanani and T M Chhaya, Strongly multiplicative labeling of some path related graphs, International Journal of Mathematics and Computer Applications Research, 5(5)(2015), 1-4.

S K Vaidya and N A Dani and P L Vihol and K K Kanani, Strongly multiplicative labeling in the context of arbitrary supersubdivision, Journal of Mathematics Research, 2(2)(2010), 28-33.

S K Vaidya and K K Kanani, Some strongly multiplicative graphs in the context of arbitrary supersubdivision, International Journal of Applied Mathematics and Computation, 3(1)(2011), 60-64.

D B West, Introduction to graph theory, PHI Learning Pvt.Ltd., (2001).


Refbacks

  • There are currently no refbacks.




Web Counters

IJMSC has been indexed in several world class data bases like Google Scholar, DRJI (Directory of Research Journals Indexing) ,Cite Factor, Research Bible.

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.