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 GP(n, k), for n ≥ 3 and 1 ≤ k < (n/2), admit strongly multiplicative labeling. Moreover, strongly multiplicative labeling of a double comb graph and sunflower planar graph has also been investigated and elaborated as well with different examples.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
