Maximizing the number of independent subsets over trees with bounded degree
From MaRDI portal
Publication:5387057
DOI10.1002/jgt.20294zbMath1156.05042OpenAlexW4238881052MaRDI 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
Related Items (19)
Laplacian coefficient, matching polynomial and incidence energy of trees with described maximum degree ⋮ The number of maximal independent sets in trees with a given number of leaves ⋮ The Estrada index of chemical trees ⋮ On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets ⋮ Maxima and minima of the Hosoya index and the Merrifield-Simmons index ⋮ Trees with given stability number and minimum number of stable sets ⋮ On Hosoya Index and Merrifield‐Simmons Index of trees with given domination number ⋮ Eccentricity of networks with structural constraints ⋮ On radius 2 trees with the maximum number of matchings ⋮ Extremal trees with fixed degree sequence ⋮ Trees with extremal numbers of \(k\)-dominating sets ⋮ Extremal problems for trees with given segment sequence ⋮ On the extremal Merrifield-Simmons index and Hosoya index of quasi-tree graphs ⋮ On the number of independent subsets in trees with restricted degrees ⋮ Trees with a given number of leaves and the maximal number of maximum independent sets ⋮ 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 ⋮ Turán Graphs, Stability Number, and Fibonacci Index
Cites Work
This page was built for publication: Maximizing the number of independent subsets over trees with bounded degree
