Maximum reciprocal degree resistance distance index of unicyclic graphs
From MaRDI portal
Publication:2195497
DOI10.1155/2020/7318968zbMath1459.05060arXiv1810.03420OpenAlexW3048059296MaRDI QIDQ2195497
Gaixiang Cai, Gui-Dong Yu, Xing-Xing Li
Publication date: 26 August 2020
Published in: Discrete Dynamics in Nature and Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.03420
Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Vertex degrees (05C07)
Related Items (2)
Maximum reciprocal degree resistance distance index of bicyclic graphs ⋮ On \({A_{\alpha}}\)-spectrum of a unicyclic graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On degree resistance distance of cacti
- On the minimum Kirchhoff index of graphs with a fixed number of cut vertices
- On the reciprocal degree distance of graphs
- The connectivity and the Harary index of a graph
- Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
- On Harary index
- On Harary index of graphs
- Relations between distance-based and degree-based topological indices
- Trees with the seven smallest and eight greatest Harary indices
- Maximum resistance-Harary index of cacti
- Minimizing Kirchhoff index among graphs with a given vertex bipartiteness
- Additively weighted Harary index of some composite graphs
- On the Kirchhoff index of graphs with diameter 2
- Weighted Harary indices of apex trees and \(k\)-apex trees
- Extremal unicyclic and bicyclic graphs with respect to Harary index
- Kirchhoff index and degree Kirchhoff index of complete multipartite graphs
- The Kirchhoff index of subdivisions of graphs
- Ordering connected graphs by their Kirchhoff indices
- Three-center Harary index and its applications
- The minimal Kirchhoff index of graphs with a given number of cut vertices
This page was built for publication: Maximum reciprocal degree resistance distance index of unicyclic graphs