[PDF] Top 20 Topological Indices of the Total Graph of Subdivision Graphs

... a graph. A Topological index is a numeric number invariant under the isomorphism of graphs and associated to a graph which completely describes the topology of the ...the topological ... See full document

... derived graph [G] † of a graph G is the graph having the same vertex set as G, with two vertices of [G] † being adjacent if and only if their distance in G is ...two. Topological ... See full document

... Proof. The crown graph has 2n vertices and 2n edges, among them n vertices are of degree one and n vertices of degree three. Therefore we get the edge partition, based on the degrees of vertices as shown in Tables ... See full document

... Zagreb indices and coindices of the line graph of the subdivision graph of tadpole graph, wheel and ...Zagreb indices of the line graph of the subdivision ... See full document

... ladder graphs using the notion of subdivision. Topological indices of line graphs of subdivision graphs of complete bipartite graphs are computed by Islam et ... See full document

... A topological index is a real number related to a structural graph of a molecule, and it does not depend on the labelling or pictorial representation of a ...of topological indices have been ... See full document

... A topological index of a molecular graph G is a numeric quantity related to G which is invariant under symmetry properties of ...Zagreb indices were originally defined as M 1 ( G ) = ∑ a ∈ V ( G ) δ ... See full document

... signed graph (see [22, 23]), denoted by S(G, σ), is a graph G(V, E) together with a function σ : E(G) → {+,−} that assigns a sign, either + or −, to each ordinary edge in ...unsigned graph G is ... See full document

... connected graph of order = ( and size = ( . A graph G is called an n-partite graph, ≥ 2 , if it possible to partition vertex– set ( in to non empty subsets , , … , (called partite sets) such that ... See full document

... connected graph with vertex set V and edge set E. A topological index of a simple connected graph G is a graph invariant which is related to the structure of the ...known topological ... See full document

... of graphs resulting from edge subdivision will be ...the subdivision graph and the total graph, belong to the folklore, while the other two were introduced in [1] and further ... See full document

... Banhatti indices for graphene chain with t = 1 and S benzene rings in this ...dimensional graph of graphene with t = 1 row and S benzene rings is shown in figure ...K-Banhatti indices for graphene ... See full document

... A topological index for a graph is a numerical quantity which is invariant under automorphisms of the ...simplest topological indices are the number of vertices and edges of the ...all ... See full document

... A topological index is a real number derived from the structure of a graph, which is invariant under graph ...a graph G is defined as ... See full document

... The concept of Geometric-Arthimetic degree (deg) index of a graph H, denoted by G/A deg(H), introduced by Mogharrab and Fath-Taber [2] is the following:.. Definition 1.1: Let H be a no[r] ... See full document

... double graph of a simple graph denoted as D[G]. The double graph of a simple graph G can be build up taking two distinct copies of the graph G and joining every vertex v in one copy to ... See full document

... Chemical Graph Theory is a branch of Mathematical Chemistry whose focus of interest is to finding topological indices of molecular graphs which correlate well with chemical properties of the ... See full document

... two indices for some very frequently used graph classes: Corollary ...pole graphs. Then the first and second Zagreb indices of the double graph of the subdivision of G are given ... See full document

... Many graph theorists computed the different topological indices for these standard graphs. In future, it may be helpful to generalize the relationship between different topo- logical ... See full document

... All graphs in the present article is finite, simple, undirected and ...For graph G = (V(G), E(G)), the order of G is 𝑝(𝐺 ) = |𝑉(𝐺)| and its size is 𝑞(𝐺) = |𝐸𝐸(𝐺)| ... See full document