[PDF] Top 20 Computing Certain Degree Based Topological Indices and Coindices of E-graphs

... two graphs. Designate two nodes ) and ) , ) ≠ ) in H as e-nodes such that there is an automorphism +: (") → (") with the property +() ) = ) ; +() ) = ) ... See full document

... simple e graphs considered in this paper are simple connected graph with vertex set V and edge set ...A topological index is a fixed number under graph ...Zagreb indices. Za- greb ... See full document

... of degree two, n vertices of degree three and one vertex of degree ...partition, based on the degrees of vertices as shown in Tables 9 and ... See full document

... A topological index of a chemical compound is an integer, derived following a certain rule, which can be used to characterize the chemical compound and predict certain physio- chemical properties ... See full document

... Carbon nanotubes, long, thin cylinders of carbon, were discovered in 1991 by S. Iijima. These are large macromolecules that are unique for their size, shape, and remarkable phys- ical properties. They can be thought of ... See full document

... Topological indices are numerical invariants, associated with the topological characterization of a ...By topological characterization, we mean that these indices relate to ... See full document

... the degree of denoted by refers number of edges incident on ...maximum degree △ of is not exceeding 4 i.e. △≤ 4. Similarly the minimum degree vertex degree of a graph is denoted by ...The ... See full document

... ∈ E G δ G + δ G , see [1, 2]. The first and second Zagreb coindices are defined as M 1 ( G ) = ∑ ab ∉ E ( G ) [ δ G a + δ G b ] and M 2 ( G ) = ∑ ab ∉ E ( G ) δ G a δ G b , see ...a ... See full document

... of graphs, determine a closed formula for a given (degree-based) topological ...of degree-based indices, in this paper we introduce the M-polynomial and demonstrate that ... See full document

... Zagreb indices have found an interesting use in the QSPR/QSAR modeling and are useful in the study of anti-inflammatory activ- ities of certain chemical ...of degree- based topological ... See full document

... diseases. Topological indices were bring together to measure the medicinal properties of new medications which is principally popular in emerging ...popular topological indices of ... See full document

... (V, E) be a simple molecular graph without directed and multiple edges and without loops, the vertex and edge sets of it are represented by V = V(G) and E = E(G), respectively ... See full document

... the topological indices value for G up to n = ...of degree 4 and two vertices are of degree 2 and four vertices are of degree ...partition, based on the degrees of vertices are ... See full document

... edge e of S is said to be positive or negative in accordance with its signature σ (e) is positive or ...positive degree of v and is denoted by d S + (v) and the number of negative edges incident on v ... See full document

... molecular graphs and thus predict properties of compounds without using quantum ...A topological index isa numerical parameter of a graph and depicts its ...are degree- based ... See full document

... 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 index of a simple connected graph which is studied in both ... See full document

... In this paper we managed to find the Schultz and modified Schultz polynomials and Schultz and modified Schultz indices of Cog- complete bipartite graph + F, G of order 2H + 2H − 2 , H, ≥ 2 . Also, we given the ... 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 graphs ... See full document

... degree based topological indices for certain types of networks, such as Silicates, hexagonal, honeycombs and ...molecular topological properties and determined the analytical ... See full document

... NadjafiArani et al. in [17,18] determined connected graphs whose difference between Szeged and Wiener numbers are n, for n = 4, 5. Following their work, Ghorbani et al. in [6] proved that for any integer ... See full document