Strongly multiplicative graphs

Abstract

A graph with p vertices is said to be strongly multiplicative if its vertices can be labelled 1, 2, . . . , p so that the values on the edges, obtained as the product of the labels of their end vertices, are all distinct. In this paper, we study structural properties of strongly multiplicative graphs. We show that all graphs in some classes, including all trees, are strongly multiplicative, and consider the question of the maximum number of edges in a strongly multiplicative graph of a given order.

On Square Divisor Cordial Graphs

“…The graph labeling is described as a frontier between number theory and structure of graphs by Beineke and Hegde [3]. There are enormous applications of graph labeling in various fields including computer science and communication networks.…”

Permutation Labeling for some Shadow Graphs

“…For a detailed survey on graph labeling we refer Gallian [5] .The brief summary of definitions and other information which are necessary for the present investigation are given below. "Graph labeling" at its heart, is a strong communication between" number theory" [3] and "structure graphs" [2,4,6]. In this paper, permutation labeling of graphs are introduced and studied.…”

Odd - Even Graceful Labeling for Different Paths using Padavon Sequence

“…According to Beinke and Hegde [1] graph labeling serves as a frontier between number theory and the structure of graphs. For a dynamic survey of various graph labeling problems along with an extensive bibiliograph, we refer to Gallian [3].…”