Trees with a given order and matching number that have maximum general sum-connectivity index.

MaRDI QIDQ2829100zbMATH OpenFDO

Authors Zhongxun Zhu, Wei Zhang

Publication date 26 October 2016

Published in Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

treematchinggeneral sum-connectivity index

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The minimum general sum-connectivity index of trees with given matching number
• On general sum-connectivity index of trees of fixed maximum degree and order
• Two-tree graphs with maximum general sum-connectivity index
• On the general sum-connectivity index of trees with given number of pendent vertices
• On the maximum general sum-connectivity index of trees with a fixed order and maximum degree

Cited in

(8)

• scientific article; zbMATH DE number 6274853 (Why is no real title available?)
• The minimum general sum-connectivity index of trees with given matching number
• Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number
• General approach for obtaining extremal results on degree-based indices illustrated on the general sum-connectivity index
• Maximum general sum-connectivity index for trees with given independence number
• On the maximum general sum-connectivity index of trees with a fixed order and maximum degree
• General sum-connectivity index of trees with given number of branching vertices
• scientific article; zbMATH DE number 6383807 (Why is no real title available?)

This page was built for publication: Trees with a given order and matching number that have maximum general sum-connectivity index.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829100)