Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star
From MaRDI portal
Publication:2185442
Recommendations
- 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 the number of spanning trees of linear crossed octagonal graphs
- Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
- Resistance distance-based graph invariants of subdivisions and triangulations of graphs
- On the normalised Laplacian spectrum, degree-Kirchhoff index and spanning trees of graphs
Cites work
- Bounds for the Kirchhoff index via majorization techniques
- Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains
- Computing lower bounds for the Kirchhoff index via majorization techniques
- Degree Kirchhoff index of unicyclic graphs
- Eigenvalues of the Laplacian of a graph∗
- Graph cyclicity, excess conductance, and resistance deficit
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Kirchhoff index of composite graphs
- New bounds for the sum of powers of normalized Laplacian eigenvalues of graphs
- New Nordhaus-Gaddum-type results for the Kirchhoff index
- On resistance-distance and Kirchhoff index
- On the Kirchhoff index and the number of spanning trees of linear phenylenes
- 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
- Resistance distance-based graph invariants of subdivisions and triangulations of graphs
- The curl of a weighted network
- The Kirchhoff index of subdivisions of graphs
- The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs
- 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, degree-Kirchhoff index and the spanning trees of linear hexagonal chains
Cited in
(9)- Several topological indices of two kinds of tetrahedral networks
- Resistance distance-based graph invariants and the number of spanning trees of linear crossed octagonal graphs
- Extremal pentagonal chains with respect to the Kirchhoff index
- Resistance distance in tensor and strong product of path or cycle graphs based on the generalized inverse approach
- Resistance distance-based graph invariants of subdivisions and triangulations of graphs
- Some resistance distance and distance-based graph invariants and number of spanning trees in the tensor product of P₂ and K_n
- Resistance distance and Kirchhoff index of unbalanced blowups of graphs
- RDDGN: minimizing the total resistance distance and diameter using graph neural networks
- Spanning 2-forests and resistance distance in 2-connected graphs
This page was built for publication: Resistance distance-based graph invariants and spanning trees of graphs derived from the strong prism of a star
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185442)