[PDF] Top 20 SOME GRAPHS WITH SUPER VERTEX SUM NUMBER 2

... center vertex (vertex with maximum degree) of each copy of the ...the number of vertices p = n(l i +l 2 +· · ·+l k +1) and the number of edges q = n(l i +l 2 +· · ·+l k ... See full document

... of vertex weights of all the vertices in G is ...a super (a,d)-vertex antimagic total lageling if ...a vertex magic total labeling ...complete graphs Kn admits VMTL using mutually ... See full document

... one vertex (root vertex) of degree two and each of the remaining vertices is of degree one or ...internal vertex (non-pendent vertex) other than the root is of degree three and all the pendent ... See full document

... Case : n = 2m + 1.( m = 0,1,2..)There will be m+1 edges with odd label number and m edges with even number as label. This will giving m+1 vertices with label 1 and m vertices with label 0. Since the biggest ... See full document

... the number vertices which has maximum degree, ...color number , it is very clear that strong dominating set should contain atleast one vertex that has maximum degree ... See full document

... In this paper we consider simple, finite, con- nected and undirected graph G = (V, E) with order p and size q is also denoted as G = (p, q) graph. We refer to Bondy and Murty[4] for the standard termi- nology and ... See full document

... every vertex v in V – S, There is at least one vertex in S at distance 1 from v and a second vertex in S at distance almost 2 from v ...domination number in G and we denote it by ... See full document

... single vertex as v i ,4 n = v i + 1,1 for i = 1, 2, 3 and v 4,4 n = v 1,1 ...+ 2 , v i n ,3 + 1 ( i = 1, 2,3, 4) , then the resulting graph is in the form of Swastik and it is denoted by Sw n ... See full document

... Harary 2 . S. Somasundaram and R.Ponraj introduced mean labeling of graphs in 3 ...introduced super mean labeling of graphs in 4 ...introduced super harmonic mean labeling in 9 . In ... See full document

... graph is a path. Following Chartrand, Lesniak [4], by a block-cut-vertex graph of a graph G we mean the graph whose vertices are the blocks and cut-vertices of G where two vertices are adjacent if and only if one ... See full document

... A mapping f :V(G) → {0,1} is called binary vertex labeling of G and f(v) is called the label of the vertex v of G under f. If for an edge e = uv, the induced edge labeling f* : E(G) → {0,1} is given by ... See full document

... The graphs considered here are finite, connected, undirected and ...The vertex set and edge set of a graph G are denoted by V (G) and E(G) ...for number theory we follow Burton ... See full document

... the sum of the labels of the incident ...incidence number of a vertex (gcin) of degree greater than one is defined as the greatest common divisor of the labels of the incident ...each vertex ... See full document

... section 2 we give some general properties and obtain the upper edge-to-vertex geodetic number of some family of ...give some general results and sharp bounds for the upper ... 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 of the incident vertices or mean of the square of ... See full document

... one vertex has eccentricity 1 with neighboring vertices whose degree sum is 7n, n vertices has eccentricity 2 with degree sum 3n + 10 and n vertices has eccentricity 2 with neighboring ... See full document

... in graphs has been introduced by Berge [1], and continued by several ...valued graphs. In [8], we studied the S- valued graphs in ...dominating vertex set and weight dominating vertex ... See full document

... the vertex set and edge set of a graph G by V (G) and E(G) respec- tively, where |V (G)| = p and |E(G)| = ...{1, 2, ...called super edge magic if ξ(V (G)) = {1, 2, ...with super edge ... See full document

... Let G be a simple graph with ‘n’ vertices & ‘m’ edges. Let the vertices of G be labeled as , , … . . . The degree of a vertex v in a graph G, denoted by d(v) is the number of edges incident to v. If all ... See full document

... of graphs called chemical graphs, which representing the chemical structure of a ...Molecular graphs are graphs in which the chemical structure under consideration are ...molecular ... See full document