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

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

Full description

Saved in:
Bibliographic Details
Main Authors: Sumiya Nasir, Nazeran Idrees, Afshan Sadiq, Fozia Bashir Farooq, Salma Kanwal, Muhammad Imran
Format: Article
Language:English
Published: Wiley 2022-01-01
Series:Journal of Mathematics
Online Access:http://dx.doi.org/10.1155/2022/3203108
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items