The number of maximal independent sets of \((k+1)\)-valent trees

DOI10.1007/BF02896409zbMath1108.05029MaRDI QIDQ2504102

Heewon Han, Junho Song, Chang Woo Lee

Publication date: 22 September 2006

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of maximal independent sets in a connected graph
• The Number of Maximal Independent Sets in a Tree
• A Note on Independent Sets in Trees
• THE NUMBER OF INDEPENDENT DOMINATING SETS OF LABELED TREES
• On cliques in graphs

This page was built for publication: The number of maximal independent sets of \((k+1)\)-valent trees