Maximizing the number of independent sets of fixed size in connected graphs with given independence number

DOI10.1007/S00373-017-1825-0zbMath1395.05129OpenAlexW2727726954MaRDI QIDQ1684927

Peng Zhang

Publication date: 12 December 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1825-0

zbMATH Keywords

independence numberindependent setconnected graphextremal graph theoryTurán connected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• Fibonacci index and stability number of graphs: a polyhedral study
• Another extremal problem for Turan graphs
• The number of maximal independent sets in a connected graph
• The maximum number of q-cliques in a graph with no p-clique
• Trees with given stability number and minimum number of stable sets
• A generalization of a theorem of Turán
• Maximal and maximum independent sets in graphs with at mostr cycles
• The number of maximal independent sets in connected graphs
• The structure and maximum number of maximum independent sets in trees
• Turán's theorem and k‐connected graphs
• On the number of complete subgraphs and circuits contained in graphs
• The number of maximum independent sets in graphs

Related Items (3)

Maximizing the number of independent sets of fixed size in Kn‐covered graphs ⋮ On the maximal number of maximum dissociation sets in forests with fixed order and dissociation number ⋮ On the maximum number of maximum independent sets of bipartite graphs

This page was built for publication: Maximizing the number of independent sets of fixed size in connected graphs with given independence number