Strength of Vertex Irregularity of Some Product of Graphs

G is a connected graph with number of vertices . Let be the set of vertices and be the set of edges of . Let be a function which assigns the integers {1, 2,G is a connected graph with number of vertices . Let be the set of vertices and be the set of edges of . Let be a function which assigns the integers {1, 2, …n} not necessarily distinct to the edges of . The weight of a vertex denoted by is the sum of all the labels of the edges which are incident with . Then the function is called a vertex irregular labelling if all the weight of the vertices are distinct. The strength of vertex irregularity of the graph denoted by is the least positive integer n such that there exists a vertex irregular labelling . In this paper, we determine the strength of vertex irregularity of some edge corona product of graphs”. …n} not necessarily distinct to the edges of . The weight of a vertex denoted by is the sum of all the labels of the edges which are incident with . Then the function is called a vertex irregular labelling if all the weight of the vertices are distinct. The strength of vertex irregularity of the graph denoted by is the least positive integer n such that there exists a vertex irregular labelling . In this paper, we determine the strength of vertex irregularity of some edge corona product of graphs”.