Trees with the seven smallest and eight greatest Harary indices
From MaRDI portal
Publication:765375
DOI10.1016/J.DAM.2011.08.014zbMATH Open1237.05061OpenAlexW1966170506MaRDI QIDQ765375FDOQ765375
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.08.014
Cites Work
- Wiener index of hexagonal systems
- Extremal unicyclic and bicyclic graphs with respect to Harary index
- Wiener index of trees: Theory and applications
- Maximizing the sum of the squares of the degrees of a graph
- On Harary index of graphs
- Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
- Wiener index of graphs with more than one cut-vertex
- On Harary index
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (28)
- Weighted Harary indices of apex trees and \(k\)-apex trees
- On a novel eccentricity-based invariant of a graph
- Some extremal properties of the multiplicatively weighted Harary index of a graph
- The Harary index of ordinary and generalized quasi-tree graphs
- Some results on the reciprocal sum-degree distance of graphs
- Maximum Detour-Harary index for some graph classes
- The Harary index of trees
- Maximum reciprocal degree resistance distance index of unicyclic graphs
- More on the Harary index of cacti
- Maximum resistance-Harary index of cacti
- Maximum \(H\)-index of bipartite network with some given parameters
- On the ordering of distance-based invariants of graphs
- On the maximal connective eccentricity index of bipartite graphs with some given parameters
- Minimal Harary index of unicyclic graphs with diameter at most 4
- On Harary index of graphs
- On the Harary Index of Graphs with Given Dissociation Number
- Bounds and extremal graphs for Harary energy
- Harary index of bipartite graphs
- On the minimum Harary index of graphs with a given diameter or independence number
- The connectivity and the Harary index of a graph
- Characterizing trees with large Laplacian energy
- On the extremal total reciprocal edge-eccentricity of trees
- Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
- Ordering trees and graphs with few cycles by algebraic connectivity
- Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree
- Further results on the reciprocal degree distance of graphs
- On the reformulated reciprocal sum-degree distance of graph transformations
- On the Harary index of graph operations
This page was built for publication: Trees with the seven smallest and eight greatest Harary indices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765375)