Maximizing the number of independent subsets over trees with bounded degree

DOI10.1002/jgt.20294zbMath1156.05042MaRDI QIDQ5387057

Clemens Heuberger, Stephan G. Wagner

Publication date: 14 May 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20294

zbMATH Keywords

independent sets; maximum degree; digit expansion; d-ary trees

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets, Turán Graphs, Stability Number, and Fibonacci Index, On Hosoya Index and Merrifield‐Simmons Index of trees with given domination number, On radius 2 trees with the maximum number of matchings, Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree, Extremal problems for trees with given segment sequence, On the number of independent subsets in trees with restricted degrees, Maxima and minima of the Hosoya index and the Merrifield-Simmons index, The Estrada index of chemical trees, On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs, Positional number systems with digits forming an arithmetic progression, Chemical trees minimizing energy and Hosoya index, Fibonacci index and stability number of graphs: a polyhedral study, Trees with given stability number and minimum number of stable sets, Trees with a given number of leaves and the maximal number of maximum independent sets, The number of maximal independent sets in trees with a given number of leaves, Eccentricity of networks with structural constraints, Extremal trees with fixed degree sequence, Trees with extremal numbers of \(k\)-dominating sets

Cites Work

• Unnamed Item