Some extremal properties of the multiplicatively weighted Harary index of a graph
From MaRDI portal
Publication:266010
DOI10.1007/s10878-014-9802-5zbMath1336.05103OpenAlexW2127013119MaRDI QIDQ266010
Publication date: 13 April 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9802-5
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Vertex degrees (05C07)
Related Items (4)
On multiplicative sum Zagreb index of trees with fixed domination number ⋮ On the (reverse) cover cost of trees with some given parameters ⋮ On Sombor index of trees with fixed domination number ⋮ Extremal trees for the general Randić index with a given domination number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the reciprocal degree distance of graphs
- Some results on the reciprocal sum-degree distance of graphs
- The eccentric connectivity index of nanotubes and nanotori
- Trees with the seven smallest and eight greatest Harary indices
- Multiplicatively weighted Harary index of graphs
- Trees with minimal Laplacian coefficients
- Comparison of graphs by their number of spanning trees
- Additively weighted Harary index of some composite graphs
- Extremal values on the eccentric distance sum of trees
- Walks and paths in trees
- Edge-grafting theorems on permanents of the Laplacian matrices of graphs and their applications
- Wiener index of trees: Theory and applications
This page was built for publication: Some extremal properties of the multiplicatively weighted Harary index of a graph