On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets

DOI10.1134/S1990478918020175zbMath1413.05185OpenAlexW2807167990MaRDI QIDQ4558291

Dmitriy S. Taletskii, Dmitriy S. Malyshev

Publication date: 21 November 2018

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

Full work available at URL: https://doi.org/10.1134/s1990478918020175

zbMATH Keywords

treeextremal combinatoricsgreatest independent set

Mathematics Subject Classification ID

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

Related Items (3)

The number of maximal independent sets in trees with a given number of leaves ⋮ On radius 2 trees with the maximum number of matchings ⋮ Trees with a given number of leaves and the maximal number of maximum independent sets

Cites Work

• The number of maximal independent sets in a connected graph
• Maximal independent sets in graphs with at most one cycle
• Energy, Hosoya index and Merrifield-Simmons index of trees with prescribed degree sequence
• Maximal independent sets in bipartite graphs
• The Number of Maximal Independent Sets in a Tree
• The structure and maximum number of maximum independent sets in trees
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• Maximizing the number of independent subsets over trees with bounded degree
• On cliques in graphs
• The number of maximum independent sets in graphs

This page was built for publication: On Trees of Bounded Degree with Maximal Number of Greatest Independent Sets