Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number

DOI10.1016/j.dam.2017.01.020zbMath1396.05026OpenAlexW2588070936MaRDI QIDQ1786880

Muhammad Kamran Jamil, Ioan Tomescu

Publication date: 25 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.01.020

zbMATH Keywords

treeconvex functionJensen's inequalityTaylor seriesmatching numberperfect matchingunicyclic graphgeneral sum-connectivity index

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (10)

A note on polyomino chains with extremum general sum-connectivity index ⋮ General sum-connectivity index of trees with given number of branching vertices ⋮ General sum-connectivity index of unicyclic graphs with given diameter and girth ⋮ General sum-connectivity index of unicyclic graphs with given diameter ⋮ On the extremal graphs for general sum-connectivity index \((\chi_{{}_\alpha})\) with given cyclomatic number when \(\alpha > 1\) ⋮ Cacti with maximal general sum-connectivity index ⋮ Unnamed Item ⋮ The minimum general sum-connectivity index of trees with given matching number ⋮ Distance-based indices of complete m-ary trees ⋮ Two-tree graphs with maximum general sum-connectivity index

Uses Software

• WolframAlpha

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permanent of the Laplacian matrix of trees and bipartite graphs
• Minimum sum-connectivity indices of trees and unicyclic graphs of a given matching number
• On a novel connectivity index
• Bounds on the largest eigenvalues of trees with a given size of matching
• On the spectral radius of unicyclic graphs with perfect matchings
• On general sum-connectivity index

This page was built for publication: Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number