[PDF] Top 20 Mean Sum Square Prime Labeling of Some Snake Graphs

... All graphs in this paper are simple, finite and undirected. The symbol V(G) and E(G) denotes the vertex set and edge set of a graph G. The graph whose cardinality of the vertex set is called the order of G, ... See full document

... Definition 3: “The Quadrilateral snake Q(Sk) is obtained from a path u1,u2,…….uk by joining ui and ui+1 for 1 ≤ i ≤ k – 1,to two new vertices vi and wi and then joining vi and wi.That is the path Pn by replacing ... See full document

... of square sum, square difference, strongly multiplicative labeling for subdivision of triangular snake graph, double triangular snake graph and subdivision of quadrilateral ... See full document

... K, Square Sum Difference Product Prime Labeling of Some Path Related Graphs, International Journal for Research in Applied Science and Engineering Technology, 5(10), 2017 ... See full document

... By a graph = ((, ( with vertices and edges we mean a simple, connected and undirected graph. In this paper a brief summary of definitions and other information is given in order to maintain compactness. The term ... See full document

... Abstract: Square sum difference product prime labeling of a graph is the labeling of the vertices with {0,1,2---------,p-1} and the edges with absolute difference of the sum of ... See full document

... triangular snake D(Tn) are super mean graph. We proved that some new graphs admit square difference ...a square difference labeling if there exists a bijection f: ...the ... See full document

... Sum square prime labeling of a graph is the labeling of the vertices with {0,1,2------,p-1} and the edges with square of the sum of the labels of the incident ...admits ... See full document

... Mean sum square prime labeling of a graph is the labeling of the vertices with {0,1,2---,p-1} and the edges with mean of the square of the sum of the labels ... See full document

... All graphs in this paper are finite and ...graph labeling is an assignment of integers to the vertices or edges. Some basic notations and definitions are taken from [1],[2],[3] and [4] .... ... See full document

... A graph G = (V, E) with p vertices and q edges is said to be square sum graph, if there exists a bijection mapping f : V (G) → {0, 1, 2, . . . , p − 1} such that the induced function f ∗ : E(G) → N defined ... See full document

... investigated some graphs like the coconut tree CT(m, n), the Y-tree Yn+1, Jelly fish graph J(m, n), the (m,2)-kite, (m,1)-kite, the theta graph Ѳ(l[m] ), for m even and complete binary tree are pair ... See full document

... neighbourhood prime labelling if there exists a labelling from the vertices of G to the first n natural numbers such that for each vertex in G with degree greater than one, the neighbourhood vertices have ... See full document

... multiplicative labeling on certain graphs”, Journal of Emerging Technologies and Innovative Research (JETIR), December, ISSN: 2349-5162 , 2018; 5(12): ...Multiplicative Labeling for Some ... See full document

... graph labeling was introduced by Rosa [3]. Graph labeling is an assignment of integers to the edges or vertices or both subject to certain ...Labeled graphs serve as useful models in a broad range of ... See full document

... Harmonic mean labeling if f(V(G)) {f(e) /eE(G)} = {1, 2, …, ...harmonic mean labeling is called Super Harmonic mean ...harmonic mean labeling of some standard ... See full document

... the graphs that satisfy triangular sum labelings will sat- ify higher order triangular sum labelings ...triangular sum labeling of standard graphs ...different graphs and ... See full document

... The graphs in this paper are finite, undirected and ...pair sum labeling has been introduced in[1].The Pair sum labeling behavior of some standard graphs like complete ... See full document

... harmonic mean labeling of graphs in [5]. Root square mean labeling was introduced by Sandhya, Somasundaram and Anusa in ...root square mean labeling of ... See full document

... A new parameter called star square graceful deficiency number of a graph is defined and the star square graceful deficiency number of the cycle 𝐶 3 is determine[r] ... See full document