Resistance distance-based graph invariants of subdivisions and triangulations of graphs

DOI10.1016/j.dam.2014.08.039zbMath1304.05040arXiv1403.1851OpenAlexW2090247235MaRDI QIDQ479050

Douglas J. Klein, Yujun Yang

Publication date: 5 December 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.1851

zbMATH Keywords

triangulationsubdivisionresistance distanceKirchhoff indexadditive degree-Kirchhoff indexmultiplicative degree-Kirchhoff index

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (24)

Inverse Perron values and connectivity of a uniform hypergraph ⋮ On the Ihara zeta function and resistance distance-based indices ⋮ Generalized characteristic polynomials of join graphs and their applications ⋮ Resistance distance distribution in large sparse random graphs ⋮ Resistance distance and Kirchhoff index in generalized R-vertex and R-edge corona for graphs ⋮ A note on generalized semitotal point graphs ⋮ Some spectral invariants of the neighborhood corona of graphs ⋮ The asymptotic behavior of (degree-)Kirchhoff indices of iterated total graphs of regular graphs ⋮ Computation of resistance distance and Kirchhoff index of the two classes of silicate networks ⋮ Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star ⋮ Ordering connected graphs by their Kirchhoff indices ⋮ Two-point resistances in the generalized phenylenes ⋮ The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes ⋮ Further results on resistance distance and Kirchhoff index in electric networks ⋮ The normalized Laplacian spectrum of subdivisions of a graph ⋮ The (degree-) Kirchhoff indices in random polygonal chains ⋮ On the spectrum of the normalized Laplacian of iterated triangulations of graphs ⋮ Hitting times for random walks on subdivision and triangulation graphs ⋮ The number of spanning trees of a family of 2-separable weighted graphs ⋮ Laplacian of a graph covering and its applications ⋮ Degree resistance distance of trees with some given parameters ⋮ The degree resistance distance of cacti ⋮ On the resistance matrix of a graph ⋮ On degree resistance distance of cacti

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Kirchhoff index of the complement of a bipartite graph
• On the Kirchhoff and the Wiener indices of graphs and block decomposition
• Kirchhoff index in line, subdivision and total graphs of a regular graph
• The asymptotic behavior of some indices of iterated line graphs of regular graphs
• Trigonometrical sums connected with the chiral Potts model, Verlinde dimension formula, two-dimensional resistor network, and number theory
• Effective graph resistance
• Random walks and the effective resistance sum rules
• On a conjecture about the Szeged index
• Wiener index of Eulerian graphs
• On the number of matchings of graphs formed by a graph operation
• Resistance distance and the normalized Laplacian spectrum
• Harmonic analysis for resistance forms.
• Bounds for the Kirchhoff index via majorization techniques
• Kirchhoff index of graphs and some graph operations
• Relationship between the edge-Wiener index and the Gutman index of a graph
• Wiener index in weighted graphs via unification of \(\varTheta^\ast\)-classes
• The (revised) Szeged index and the Wiener index of a nonbipartite graph
• Improved bounds on the difference between the Szeged index and the Wiener index of graphs
• On extremal bipartite unicyclic graphs
• A recursion formula for resistance distances and its applications
• The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs
• Comment on ``Kirchhoff index in line, subdivision and total graphs of a regular graph
• Comparison between the Wiener index and the Zagreb indices and the eccentric connectivity index for trees
• Complete solution of equation \(W(L^3(T))=W(T)\) for the Wiener index of iterated line graphs of trees
• The Kirchhoff index of subdivisions of graphs
• An infinite family of graphs with a facile count of perfect matchings
• Some physical and chemical indices of clique-inserted lattices
• An Electrical Lemma
• Minimizing Effective Resistance of a Graph
• Metric and ultrametric spaces of resistances
• Some new results on distance-based graph invariants

This page was built for publication: Resistance distance-based graph invariants of subdivisions and triangulations of graphs