Trees with the seven smallest and eight greatest Harary indices

DOI10.1016/J.DAM.2011.08.014zbMATH Open1237.05061OpenAlexW1966170506MaRDI QIDQ765375FDOQ765375

Authors Kexiang Xu 

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

zbMATH Keywords

treeHarary indexgraph transformationsum of reciprocals of distances

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Recommendations

• The Harary index of trees
• On the Harary index of the caterpillars
• Minimal Harary index of graphs with small parameters
• Harary index of Eulerian graphs
• The Harary index of tricyclic graphs

Cites work

• scientific article; zbMATH DE number 2185797 (Why is no real title available?)
• scientific article; zbMATH DE number 4074878 (Why is no real title available?)
• scientific article; zbMATH DE number 1890082 (Why is no real title available?)
• scientific article; zbMATH DE number 1890120 (Why is no real title available?)
• scientific article; zbMATH DE number 2121251 (Why is no real title available?)
• Erratum to ``The trees on \(n \geq 9\) vertices with the first to seventeenth greatest wiener indices are chemical trees
• Extremal unicyclic and bicyclic graphs with respect to Harary index
• Graph theory
• Hyper-Wiener and Harary indices of graphs with cut edges
• Maximizing the sum of the squares of the degrees of a graph
• On Harary index
• On Harary index of graphs
• The trees on \(n\geq 9\) vertices with the first to seventeenth greatest Wiener indices are chemical trees
• Trees with the seven smallest and fifteen greatest hyper-Wiener indices
• Wiener index of graphs with more than one cut-vertex
• Wiener index of hexagonal systems
• Wiener index of trees: Theory and applications
• Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number

Cited in

(29)

• Ordering trees and graphs with few cycles by algebraic connectivity
• Maximum reciprocal degree resistance distance index of unicyclic graphs
• On the reformulated reciprocal sum-degree distance of graph transformations
• On the Harary Index of Graphs with Given Dissociation Number
• More on the Harary index of cacti
• Maximum resistance-Harary index of cacti
• On the maximal connective eccentricity index of bipartite graphs with some given parameters
• Weighted Harary indices of apex trees and \(k\)-apex trees
• Tree with maximum non-self-centrality number among all trees of fixed order and maximum degree
• Maximum \(H\)-index of bipartite network with some given parameters
• On Harary index of graphs
• Characterizing trees with large Laplacian energy
• On the ordering of distance-based invariants of graphs
• Minimal Harary index of unicyclic graphs with diameter at most 4
• On the Harary index of the caterpillars
• On a novel eccentricity-based invariant of a graph
• The Harary index of ordinary and generalized quasi-tree graphs
• Harary index of bipartite graphs
• Some results on the reciprocal sum-degree distance of graphs
• On the Harary index of graph operations
• On the extremal total reciprocal edge-eccentricity of trees
• Four edge-grafting theorems on the reciprocal degree distance of graphs and their applications
• Bounds and extremal graphs for Harary energy
• The Harary index of trees
• Maximum Detour-Harary index for some graph classes
• Some extremal properties of the multiplicatively weighted Harary index of a graph
• The connectivity and the Harary index of a graph
• On the minimum Harary index of graphs with a given diameter or independence number
• Further results on the reciprocal degree distance of graphs

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)