Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
From MaRDI portal
(Redirected from Publication:2053002)
Abstract: Resistance distance is a novel distance function, also a new intrinsic graph metric, which makes some extensions of ordinary distance. Let On be a linear crossed octagonal graph. Recently, Pan and Li (2018) derived the closed formulas for the Kirchhoff index, multiplicative degree-Kirchhoff index and the number of spanning trees of Hn. They pointed that it is interesting to give the explicit formulas for the Kirchhoff and multiplicative degree-Kirchhoff indices of On. Inspired by these, in this paper, two resistance distance-based graph invariants, namely, Kirchhoff and multiplicative degree-Kirchhoff indices are studied. We firstly determine formulas for the Laplacian (normalized Laplacian, resp.) spectrum of On. Further, the formulas for those two resistance distance-based graph invariants and spanning trees are given. More surprising, we find that the Kirchhoff (multiplicative degree-Kirchhoff, resp.) index is almost one quarter to Wiener (Gutman, resp.) index of a linear crossed octagonal graph.
Recommendations
- Kirchhoff index, degree-Kirchhoff index and spanning trees of linear octagonal chains.
- Some resistance distance and distance-based graph invariants and number of spanning trees in the tensor product of P₂ and K_n
- Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star
- On the Kirchhoff index of some toroidal lattices
- Resistance distance-based graph invariants of subdivisions and triangulations of graphs
Cites work
- Asymptotic Laplacian-energy-like invariant of lattices
- Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
- Generalized adjacency and Laplacian spectra of the weighted corona graphs
- Graph cyclicity, excess conductance, and resistance deficit
- Graphs that minimizing symmetric division deg index
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- On the Kirchhoff index and the number of spanning trees of linear phenylenes
- On the Laplacian spectral radius of bipartite graphs with fixed order and size
- On the normalised Laplacian spectrum, degree-Kirchhoff index and spanning trees of graphs
- On the normalized Laplacians with some classical parameters involving graph transformations
- Resistance distance and the normalized Laplacian spectrum
- Spectral analysis for weighted iterated triangulations of graphs
- The Hosoya index of graphs formed by a fractal graph
- The normalized Laplacian, degree-Kirchhoff index and spanning trees of the linear polyomino chains
- The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes
- The normalized Laplacians on both \(k\)-triangle graph and \(k\)-quadrilateral graph with their applications
- The normalized Laplacians, degree-Kirchhoff index and the spanning trees of hexagonal Möbius graphs
- The normalized Laplacians, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
- Zagreb indices and multiplicative Zagreb indices of Eulerian graphs
Cited in
(12)- The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain
- Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star
- Complete characterization of resistance distance for linear octagonal networks
- Kirchhoff index, degree-Kirchhoff index and spanning trees of linear octagonal chains.
- Spectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagons
- Some resistance distance and distance-based graph invariants and number of spanning trees in the tensor product of P₂ and K_n
- Computation of resistance distance with Kirchhoff index of body centered cubic structure
- Extremal polygonal chains with respect to the Kirchhoff index
- On the exponential augmented Zagreb index of graphs
- RDDGN: minimizing the total resistance distance and diameter using graph neural networks
- On the resistance distance and Kirchhoff index of K_n-chain(ring) network
- Resistance distance and Kirchhoff index of extended Kagome lattice chain
This page was built for publication: Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053002)
