[PDF] Top 20 On the edge and total GA indices of some graphs

... ize some property of the graph of a molecule is called a topological index for that ...found some applications in theoretical chemistry, especially in QSPR/QSAR research ...the edge versions of ... See full document

... PI indices of the tensor and strong products of graphs are studied in [14, ...PI indices of bridge graphs and chain graphs are ...the edge Co-PI indices of graphs ... See full document

... These indices were defined in 1972 by Gutman and Trinajstic, [5]. In [3], some results on the first Zagreb index together with some other indices were ...these indices were studied. ... See full document

... Let G 1 and G 2 be two connected graphs with disjoint vertex sets V ( G 1 ) and V ( G 2 ) and edge sets E ( G 1 ) and E ( G 2 ) , respectively. For given vertices a 1  V ( G 1 ) and a 2  V ( G 2 ) , a ... See full document

... )- edge coloring of some graphs. The ′( , )-edge coloring of a graph is an assignment of non-negative integers to the edges and of such that | ( ) − ( )| ≥ if ( , ) = and | ( ) − ( )| ≥ if ( , ... See full document

... in graphs. Mitchell and Hedetniemi [7] and Xu [14] have worked on edge domination ...trapezoid graphs. In [8, 10] have studied about total domination related parameters and in [1, 13] have ... See full document

... and edge the K-Banhatti indices can be defined for molecular ...K-Banhatti indices of molecular graph refer to ...K-Banhatti indices, K-Banhatti Randic index, K-Banhatti reciprocal Randic ... See full document

... the edge energy of G (or energy of line of G) which is defined as sum of the absolute values of eigenvalues of edge adjacency matrix of ...the edge energy of specific ... See full document

... adjacent edge graceful labeling was first introduced in [18].Some results on adjacent edge graceful labeling of graphs and some non- adjacent edge graceful graphs are ... See full document

... two graphs G and H is the graph obtained by taking one copy of G, |V(G)| copies of H and joining i-th vertex of G to every vertex in the i-th copy of ...The edge corona [17] of two graphs G and H ... See full document

... an edge even graceful labeling for some path-related graphs like Y- tree, the double star B n,m , the graph K 1,2n : K 1,2m , the graph P 2n−1 K 2m , and double fan graph F 2,n ... See full document

... The total product cordial labeling is a variant of cordial ...an edge analogue product cordial labeling as a variant of total product cordial labeling and name it as total edge product ... See full document

... The edge dominating set of a graph G = (V, E) is the subset F E such that each edge in E is either in F or is adjacent to an edge in ...an edge in G is defined as  (G ) and diameter of a ... See full document

... an edge dominating set if every edge e in E − F is adjacent to at least one edge in F ...The edge domination number γ 0 (G) of G is the minimum cardinality of an edge dominating set of ... See full document

... graph G is the number of vertices adjacent to u. The notation uv represents an edge between two vertices u and v in G. The distance d(u, v) between any two vertices u and v is the length of shortest path ... See full document

... G = with V i = p i , i = 1, 2 . Also, the underlying set V is assumed to be finite and σ can be chosen in any manner so as to satisfy the definition of a fuzzy graph in all the examples and all these properties are ... See full document

... topological indices. Topological indices are usually defined via the molecular ...the edge set E, that | V |  n and | E |  m ...geometric–arithmetic indices of graphs and its ... See full document

... each edge of G. Subdivision graphs are used to obtain several mathematical and chemical properties of more complex graphs from more basic graphs and there are many results on these ...each ... See full document

... V = q . Also, the underlying set V is assumed to be finite and σ can be chosen in any manner so as to satisfy the definition of a fuzzy graph in all the examples and all these properties are satisfied for all fuzzy ... See full document

... Definition 2.1. [1] Let G be a simple graph of order n. Then R G ( ) be the graph obtained from G by adding a new vertex corresponding to each edge of G and by joining each new vertex to the end points, of the ... See full document