The connectivity and the Harary index of a graph
From MaRDI portal
Publication:479037
DOI10.1016/J.DAM.2014.08.022zbMATH Open1304.05037arXiv1207.2393OpenAlexW2075970225MaRDI QIDQ479037FDOQ479037
Authors: Xiaoxin Li, Yizheng Fan 
Publication date: 5 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract: The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper we provide an upper bound of the Harary index in terms of the vertex or edge connectivity of a graph. We characterize the unique graph with maximum Harary index among all graphs with given number of cut vertices or vertex connectivity or edge connectivity. In addition we also characterize the extremal graphs with the second maximum Harary index among the graphs with given vertex connectivity.
Full work available at URL: https://arxiv.org/abs/1207.2393
Recommendations
Cites Work
- Extremal unicyclic and bicyclic graphs with respect to Harary index
- Trees with the seven smallest and eight greatest Harary indices
- Hyper-Wiener and Harary indices of graphs with cut edges
- On Harary index of graphs
- Zagreb, Harary and hyper-Wiener indices of graphs with a given matching number
- On the maximal Harary index of a class of bicyclic graphs
- On Harary index
- The Harary index of trees
- THE HARARY INDEX OF A GRAPH UNDER PERTURBATION
- Title not available (Why is that?)
Cited In (32)
- Wiener-type invariants and Hamiltonian properties of graphs
- Maximum Detour-Harary index for some graph classes
- An upper bound for the Harary index of a connected graph and the corresponding extremal graph
- The connectivity and the modified second multiplicative Zagreb index of graphs
- Maximum reciprocal degree resistance distance index of unicyclic graphs
- Maximum resistance-Harary index of cacti
- On Harary index
- THE HARARY INDEX OF A GRAPH UNDER PERTURBATION
- The extremal graphs of some topological indices with given vertex \(k\)-partiteness
- Maximum \(H\)-index of bipartite network with some given parameters
- On the maximal connective eccentricity index of bipartite graphs with some given parameters
- Wiener index, Harary index and graph properties
- 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
- Nordhaus-Gaddum type results for the Harary index of graphs
- Maximum additively weighted Harary index of graphs with given connectivity or matching number
- Steiner Harary index and connectivity of graphs
- Harary index and some Hamiltonian properties of graphs
- Harary index of bipartite graphs
- Wiener-type invariants and \(k\)-leaf-connected graphs
- The index of a special bipartite graph
- Bounds on Harary index
- On the graph connectivity and the variable sum exdeg index
- The Harary index of digraphs.
- On the multiplicative sum Zagreb index of graphs with some given parameters
- Harary index of Eulerian graphs
- On the extremal total reciprocal edge-eccentricity of trees
- The generalized 4-connectivity of hypercubes
- On the monotonicity of topological indices and the connectivity of a graph
- Steiner Harary index
- On the reformulated reciprocal sum-degree distance of graph transformations
This page was built for publication: The connectivity and the Harary index of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479037)
