Resistance distance-based graph invariants of subdivisions and triangulations of graphs
From MaRDI portal
Publication:479050
DOI10.1016/J.DAM.2014.08.039zbMATH Open1304.05040arXiv1403.1851OpenAlexW2090247235MaRDI QIDQ479050FDOQ479050
Authors: Yujun Yang, Douglas J. Klein 
Publication date: 5 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract: We study three resistance distance-based graph invariants: the Kirchhoff index, and two modifications, namely, the multiplicative degree-Kirchhoff index and the additive degree-Kirchhoff index. In work in press, one of the present authors (2014) and Sun et al. (2014) independently obtained (different) formulas for the Kirchhoff index of subdivisions of graphs. Huang et al. (2014) obtained a formula for the Kirchhoff index of triangulations of graphs. In our paper, first we derive formulae for the additive degree-Kirchhoff index and the multiplicative degree-Kirchhoff index of subdivisions and triangulations, as well as a new formula for the Kirchhoff index of triangulations, in terms of invariants of . Then comparisons are made between each of our Kirchhoffian graph invariants for subdivision and triangulation. Finally, formulae for these graph invariants of iterated subdivisions and triangulations of graphs are obtained.
Full work available at URL: https://arxiv.org/abs/1403.1851
Recommendations
- Nordhaus-Gaddum-type results for resistance distance-based graph invariants
- Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
- Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star
- On distance-based graph invariants
- Resistance distance in complete \(n\)-partite graphs
- Resistance distances and Kirchhoff index of graphs with an involution
- Resistance distances in vertex-weighted complete multipartite graphs
- Some results of resistance distance and Kirchhoff index of subdivision vertex-edge corona for graphs
- Distance-residual subgraphs
- Some new results on distance-based graph invariants
triangulationKirchhoff indexresistance distancesubdivisionadditive degree-Kirchhoff indexmultiplicative degree-Kirchhoff index
Cites Work
- Bounds for the Kirchhoff index via majorization techniques
- On extremal bipartite unicyclic graphs
- A recursion formula for resistance distances and its applications
- The Kirchhoff index of subdivisions of graphs
- Some physical and chemical indices of clique-inserted lattices
- Title not available (Why is that?)
- Kirchhoff index in line, subdivision and total graphs of a regular graph
- Degree resistance distance of unicyclic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a conjecture about the Szeged index
- Resistance distance and the normalized Laplacian spectrum
- 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
- The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs
- Some new results on distance-based graph invariants
- Wiener index of Eulerian graphs
- Kirchhoff index of graphs and some graph operations
- Comment on ``Kirchhoff index in line, subdivision and total graphs of a regular graph
- On the Kirchhoff and the Wiener indices of graphs and block decomposition
- Degree Kirchhoff index of unicyclic graphs
- Harmonic analysis for resistance forms.
- The asymptotic behavior of some indices of iterated line graphs of regular graphs
- Relationship between the edge-Wiener index and the Gutman index of a graph
- Comparison between the Wiener index and the Zagreb indices and the eccentric connectivity index for trees
- Metric and ultrametric spaces of resistances
- Random walks and the effective resistance sum rules
- On the Kirchhoff index of the complement of a bipartite graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimizing Effective Resistance of a Graph
- Effective graph resistance
- Complete solution of equation \(W(L^3(T))=W(T)\) for the Wiener index of iterated line graphs of trees
- An infinite family of graphs with a facile count of perfect matchings
- Note on degree Kirchhoff index of graphs
- An Electrical Lemma
- Trigonometrical sums connected with the chiral Potts model, Verlinde dimension formula, two-dimensional resistor network, and number theory
- On the number of matchings of graphs formed by a graph operation
Cited In (29)
- Resistance distance and Kirchhoff index in generalized R-vertex and R-edge corona for graphs
- Further results on resistance distance and Kirchhoff index in electric networks
- On the resistance matrix of a graph
- On degree resistance distance of cacti
- Some results of resistance distance and Kirchhoff index of subdivision vertex-edge corona for graphs
- Computation of the resistance distance and the Kirchhoff index for the two types of claw-free cubic graphs
- The (degree-) Kirchhoff indices in random polygonal chains
- Inverse Perron values and connectivity of a uniform hypergraph
- The asymptotic behavior of (degree-)Kirchhoff indices of iterated total graphs of regular graphs
- The number of spanning trees of a family of 2-separable weighted graphs
- Resistance distance distribution in large sparse random graphs
- A note on generalized semitotal point graphs
- The degree resistance distance of cacti
- Laplacian of a graph covering and its applications
- Some spectral invariants of the neighborhood corona of graphs
- Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
- On the Ihara zeta function and resistance distance-based indices
- Computation of resistance distance and Kirchhoff index of the two classes of silicate networks
- Some results on resistance distances and resistance matrices
- Resistance distance and Kirchhoff index of two kinds of double join operations on graphs
- Generalized characteristic polynomials of join graphs and their applications
- Degree resistance distance of trees with some given parameters
- Hitting times for random walks on subdivision and triangulation graphs
- The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes
- The normalized Laplacian spectrum of subdivisions of a graph
- On the spectrum of the normalized Laplacian of iterated triangulations of graphs
- Two-point resistances in the generalized phenylenes
- Ordering connected graphs by their Kirchhoff indices
- Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star
This page was built for publication: Resistance distance-based graph invariants of subdivisions and triangulations of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479050)
