Extremal values on the harmonic number of trees
From MaRDI portal
Publication:3451415
DOI10.1080/00207160.2014.965696zbMath1325.05094OpenAlexW2011583775MaRDI QIDQ3451415
Shuchao Li, Qin Zhao, Qiong Fan
Publication date: 16 November 2015
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.965696
Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
Cites Work
- Unnamed Item
- Harmonic numbers, Catalan's triangle and mesh patterns
- The harmonic index for graphs
- Extremal energies of trees with a given domination number
- Minimum general sum-connectivity index of unicyclic graphs
- On the general sum-connectivity index of trees
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Permanent of the Laplacian matrix of trees and bipartite graphs
- On a novel connectivity index
- On graphs having domination number half their order
- Bounds on the largest eigenvalues of trees with a given size of matching
- Extremal graphs for inequalities involving domination parameters
- On general sum-connectivity index
- Extremal values on the eccentric distance sum of trees
- On the harmonic index and the chromatic number of a graph
This page was built for publication: Extremal values on the harmonic number of trees