Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum
From MaRDI portal
Publication:2020461
Recommendations
- On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum
- Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance
- Extremal graphs with diameter 2 for two indices on resistance-distance
- On the eccentric distance sum of trees and unicyclic graphs
- Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications
Cites work
- scientific article; zbMATH DE number 5627524 (Why is no real title available?)
- scientific article; zbMATH DE number 1054729 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
- Bounds for the Kirchhoff index via majorization techniques
- Cacti with maximum eccentricity resistance-distance sum
- Computing lower bounds for the Kirchhoff index via majorization techniques
- Degree Kirchhoff index of bicyclic graphs
- Degree Kirchhoff index of unicyclic graphs
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- Effective graph resistance
- Extremal values on the eccentric distance sum of trees
- Further results on the eccentric distance sum
- Graphs with given diameter maximizing the algebraic connectivity
- Kirchhoff index and degree Kirchhoff index of complete multipartite graphs
- Kirchhoff index of composite graphs
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- On eccentric distance sum and minimum degree
- On the Kirchhoff index of bipartite graphs with given diameters
- On the Kirchhoff index of graphs with diameter 2
- On the Kirchhoff index of the complement of a bipartite graph
- On the eccentric distance sum of graphs
- On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum
- On the extremal values of the eccentric distance sum of trees
- On the extremal values of the eccentric distance sum of trees
- On the extreme eccentric distance sum of graphs with some given parameters
- On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- On the sum of all distances in bipartite graphs
- Resistance distance and the normalized Laplacian spectrum
- Resistance distances and the Kirchhoff index in Cayley graphs
- Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications
- The Kirchhoff indices and the matching numbers of unicyclic graphs
- The Wiener index of random digital trees
- The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes
- Wiener index of trees: Theory and applications
Cited in
(5)- Extremal graphs with diameter 2 for two indices on resistance-distance
- Extremal degree resistance distances in fully loaded unicyclic graphs.
- Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications
- Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance
- On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum
This page was built for publication: Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2020461)
