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

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

Full description

Saved in:
Bibliographic Details
Published in:Journal of mathematics (Hidawi) 2022, Vol.2022 (1)
Main Authors: Nasir, Sumiya, Idrees, Nazeran, Sadiq, Afshan, Bashir Farooq, Fozia, Kanwal, Salma, Imran, Muhammad
Format: Article
Language:English
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 n ≥ 3, umbrella graph Um,n, and generalized Petersen graph GPn,k, for n≥3 and 1≤k
ISSN:2314-4629
2314-4785
DOI:10.1155/2022/3203108