Further analysis on the total number of subtrees of trees

zbMath1266.05010arXiv1204.6152MaRDI QIDQ1953360

Shujing Wang, Shuchao Li

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.6152

zbMATH Keywords

Wiener indexdomination numberbipartitionsubtreesleaves\(q\)-ary tree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (15)

Maximum number of subtrees in cacti and block graphs ⋮ Greedy trees, subtrees and antichains ⋮ Extremal problems for connected set enumeration ⋮ The number of subtrees of trees with given diameter ⋮ The minimal number of subtrees of a tree ⋮ The number of subtrees in graphs with given number of cut edges ⋮ Subtrees of spiro and polyphenyl hexagonal chains ⋮ Permanental bounds of the Laplacian matrix of trees with given domination number ⋮ Extremal problems for trees with given segment sequence ⋮ On the number of connected subgraphs of graphs ⋮ On \(\sigma\)-span and \(F\)-span of trees and full binary trees ⋮ On the coefficients of the independence polynomial of graphs ⋮ Some extremal ratios of the distance and subtree problems in binary trees ⋮ Cut and pendant vertices and the number of connected induced subgraphs of a graph ⋮ Independence polynomials of bipartite graphs

This page was built for publication: Further analysis on the total number of subtrees of trees