[PDF] Top 20 Resistance Distance and Kirchhoff Index of Two Edge-subdivision Corona Graphs

... resistance distance between u and v in G and Kf(G) denote the Kirchhoff index of ...The resistance distance and the Kirchhoff index have attracted extensive ... See full document

... All graphs considered in this paper are simple and undirected. The resistance distance between vertices u and v of G was defined by Klein and Randi ´ c [1] to be the effective resistance ... See full document

... Abstract—The resistance distance between any two vertices of a connected graph is defined as the effective resistance between them in the electrical network constructed from the graph by ... See full document

... the resistance distance between these vertices are denoted by r ij ...new distance is an effective resistance between nodes v i and v j according to Ohm's law ...all resistance ... See full document

... topological index along the line of this strategy was developed by Klein and Randić, who defined the so-called Kirchhoff index, Kf ...The Kirchhoff index is defined in an analogous way ... See full document

... the resistance distance between two arbitrary vertices in an electrical network can be obtained in terms of the eigenvalues and eigenvectors of the combinato- rial Laplacian matrix and the normalized ... See full document

... Wiener index is a classical distance based topological ...Wiener index has been extensively studied by many chemists and ...Wiener index the reader may refer to [5, 6, 12, 16, ...These ... See full document

... between Kirchhoff index and the Laplacian–energy–like invariant, Linear Algebra ...between Kirchhoff index, Laplacian–energy– like invariant and Laplacian energy of graphs, ... See full document

... The subdivision graph S(G) is the graph obtained from G by replacing each of its edge by a path of length ...G, two vertices e and f are incident if and only if they have a common end vertex in ... See full document

... to distance properties of some graph ...HyperZagreb index. Example 1. In this example the HyperZagreb index of some well-known graphs are ... See full document

... Throughout this paper, we only consider finite, connected, undirected and simple graphs. Let be such a graph with the vertex set ( ) and the edge set ( ). For a vertex ∈ ( ), ( ) denotes the degree of which ... See full document

... Since then, there were various applications of the Estrada index. Initially, it was used to quantify the degree of folding of long chain polymeric molecules, especially those of proteins [14, 15]. And later, a ... See full document

... minimal edge dominating set since for any edge e i ∈ F , F − { } e i is not an edge dominating set for N ( e i ) in G ...an edge of G can dominate at most 2 n + 1 distinct edges including ... See full document

... from two given fuzzy graphs using union and ...an edge in fuzzy graphs formed by these operations in terms of the degree of edges in the given fuzzy graphs in some particular ... See full document

... Wiener index. 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 ...Wiener index is one of the ... See full document

... this index can enhance the physico-chemical applicability of Zagreb ...K-edge index which is defined as the sum of the cubes of the edge degrees of a ...K-edge index, ... See full document

... paper, resistance distances in complete multipartite graphs are given via the stan- dard electrical ...the resistance-distance matrix of complete multipartite graphs are studied, with ... See full document

... many graphs arise from simpler graphs via various graph operations and one can study the properties of smaller graphs and deriving with it some information about larger ...product graphs are ... See full document

... revised edge-Szeged index of unicyclic graphs and using this result we identify the minimum revised edge- Szeged index of conjugated unicyclic graphs which is defined as the ... See full document

... A subdivision of an edge e=uv of a graph G is the replacement of the edge e by a path ...each edge of G exactly once is called the subdivision graph of G and is denoted by  ... See full document