Extremal bipartite graphs and unicyclic graphs with respect to the eccentric resistance-distance sum
DOI10.1016/J.JMAA.2021.125121zbMATH Open1462.05101OpenAlexW3135427953MaRDI QIDQ2020461FDOQ2020461
Shuchao S. C. Li, Changlong C. L. Shen
Publication date: 23 April 2021
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2021.125121
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
Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Distance in graphs (05C12)
Cites Work
- Bounds for the Kirchhoff index via majorization techniques
- On the Kirchhoff index of graphs with diameter 2
- Extremal values on the eccentric distance sum of trees
- Title not available (Why is that?)
- Resistance distances and the Kirchhoff index in Cayley graphs
- Wiener index of trees: Theory and applications
- Resistance distance and the normalized Laplacian spectrum
- Title not available (Why is that?)
- Title not available (Why is that?)
- Application of graph theory: Relationship of eccentric connectivity index and Wiener's index with anti-inflammatory activity
- The Kirchhoff indices and the matching numbers of unicyclic graphs
- On the sum of all distances in bipartite graphs
- On the extreme eccentric distance sum of graphs with some given parameters
- On eccentric distance sum and minimum degree
- On the eccentric distance sum of graphs
- On the extremal values of the eccentric distance sum of trees
- Further results on the eccentric distance sum
- Title not available (Why is that?)
- Kirchhoff index of composite graphs
- The Wiener Index of Random Digital Trees
- Eccentric distance sum: A novel graph invariant for predicting biological and physical properties
- On the minimum eccentric distance sum of bipartite graphs with some given parameters
- Some edge-grafting transformations on the eccentricity resistance-distance sum and their applications
- On the extremal values of the eccentric distance sum of trees
- On the Kirchhoff index of the complement of a bipartite graph
- Title not available (Why is that?)
- Effective graph resistance
- Graphs with given diameter maximizing the algebraic connectivity
- Cacti with maximum eccentricity resistance-distance sum
- On the extremal graphs of diameter 2 with respect to the eccentric resistance-distance sum
- The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes
- Kirchhoff index and degree Kirchhoff index of complete multipartite graphs
- Degree Kirchhoff Index of Bicyclic Graphs
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- On the minimum Kirchhoff index of graphs with a given vertex \(k\)-partiteness and edge \(k\)-partiteness
- On the Kirchhoff index of bipartite graphs with given diameters
Cited In (1)
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)
