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

zbMATH Open1413.05307MaRDI QIDQ2829100

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) 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) Connectivity (05C40)

Related Items (3)

General sum-connectivity index of trees with given number of branching vertices ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?)

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)