Maximising the number of independent sets in connected graphs
نویسندگان
چکیده
A Turán connected graph TCn,α is obtained from α cliques of size b αc or d αe by joining all cliques by an edge to one central vertex in one of the larger cliques. The graph TCn,α was shown recently by Bruyère and Mélot to maximise the number of independent sets among connected graphs of order n and independence number α. We prove a generalisation of this result by showing that TCn,α in fact maximises the number of independent sets of any fixed cardinality β ≤ α. Several results (both old and new) on the number of independent sets or maximum independent sets follow as corollaries.
منابع مشابه
Different-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملINDEPENDENT SETS OF SOME GRAPHS ASSOCIATED TO COMMUTATIVE RINGS
Let $G=(V,E)$ be a simple graph. A set $Ssubseteq V$ isindependent set of $G$, if no two vertices of $S$ are adjacent.The independence number $alpha(G)$ is the size of a maximumindependent set in the graph. In this paper we study and characterize the independent sets ofthe zero-divisor graph $Gamma(R)$ and ideal-based zero-divisor graph $Gamma_I(R)$of a commutative ring $R$.
متن کاملTOTAL DOMINATION POLYNOMIAL OF GRAPHS FROM PRIMARY SUBGRAPHS
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of total dominating set in $G$ and denoted by $gamma_t(G)$. The total domination polynomial of $G$ is the polynomial $D_t(G,x)=sum d_t(G,i)$, where $d_t(G,i)$ is the numbe...
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کاملMaximizing the Number of Independent Sets of Fixed Size in Connected Graphs with Given Independence Number
The Turán connected graph TCn,α is obtained from α cliques of size b αc or d αe by joining all cliques by an edge to one central vertex in one of the larger cliques. The graph TCn,α was shown recently by Bruyère and Mélot to maximise the number of independent sets among connected graphs of order n and independence number α. We prove a generalisation of this result by showing that TCn,α in fact ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015