Extremal unicyclic and bicyclic graphs with respect to Harary index
From MaRDI portal
Publication:2376936
zbMath1267.05276MaRDI QIDQ2376936
Kexiang Xu, Kinkar Chandra Das
Publication date: 26 June 2013
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: http://math.usm.my/bulletin/html/vol36_2_12.html
Related Items (23)
Characterization of the minimizing graph of the connected graphs whose complements are bicyclic ⋮ Maximum \(H\)-index of bipartite network with some given parameters ⋮ Maximum resistance-Harary index of cacti ⋮ On the lower and upper bounds for different indices of tricyclic graphs ⋮ On the minimum Harary index of graphs with a given diameter or independence number ⋮ Multiplicatively weighted Harary index of graphs ⋮ Wiener indices of spiro and polyphenyl hexagonal chains ⋮ Minimal Harary index of unicyclic graphs with diameter at most 4 ⋮ Bounds and extremal graphs for Harary energy ⋮ Algorithms for enumerating multiple leaf-distance granular regular \(\alpha\)-subtree of unicyclic and edge-disjoint bicyclic graphs ⋮ On the ordering of distance-based invariants of graphs ⋮ Maximum reciprocal degree resistance distance index of unicyclic graphs ⋮ On the reciprocal degree distance of graphs ⋮ On the Harary Index of Graphs with Given Dissociation Number ⋮ The Harary index of all unicyclic graphs with given diameter ⋮ The connectivity and the Harary index of a graph ⋮ More on the Harary index of cacti ⋮ The Harary index of ordinary and generalized quasi-tree graphs ⋮ Trees with the seven smallest and eight greatest Harary indices ⋮ Maximum Detour-Harary index for some graph classes ⋮ Harary index of bipartite graphs ⋮ Weighted Harary indices of apex trees and \(k\)-apex trees ⋮ On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs
This page was built for publication: Extremal unicyclic and bicyclic graphs with respect to Harary index
