Strongly Multiplicative Labeling of Diamond Graph, Generalized Petersen Graph, and Some Other Graphs

Sumiya Nasir, Nazeran Idrees, Afshan Sadiq, Fozia Bashir Farooq, Salma Kanwal, Muhammad Imran and A. Ghareeb

Journal of Mathematics, 2022, vol. 2022, 1-5

Abstract: A finite, simple graph of order k is said to be a strongly multiplicative graph when all vertices of the graph are labeled by positive integers 1,2,3,…,k such that the induced edge labels of the graph, obtained by the product of labels of end vertices of edges, are distinct. In this paper, we show that the diamond graph Brn  for 𠑛 ≥ 3, umbrella graph Um,n, and generalized Petersen graph GPn,k, for n≥3 and 1≤k

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2022/3203108.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2022/3203108.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jjmath:3203108

DOI: 10.1155/2022/3203108

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().