Maximal independent sets in graphs with at most r cycles
نویسندگان
چکیده
We find the maximum number of maximal independent sets in two families of graphs. The first family consists of all graphs with n vertices Contract grant sponsor: Award from DIMACS (partially; to V.R.V.); Contract grant sponsor: NSF VIGRE grant to the Rutgers University Department of Mathematics (partially; to V.R.V.). Journal of Graph Theory © 2006 Wiley Periodicals, Inc. 270 MAXIMAL INDEPENDENT SETS 271 and at most r cycles. The second family is all graphs of the first family which are connected and satisfy n ≥ 3r. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 270–282, 2006
منابع مشابه
The Second Largest Number of Maximal Independent Sets in Graphs with at Most Two Cycles
Amaximal independent set is an independent set that is not a proper subset of any other independent set. Jou and Chang determined the largest number of maximal independent sets among all graphs and connected graphs of order n, which contain at most one cycle. Later B. E. Sagan and V. R. Vatter found the largest number of maximal independent sets among all graphs of order n, which contain at mos...
متن کاملMaximal and maximum independent sets in graphs with at most r cycles
We find the maximum number of maximal independent sets in two families of graphs: all graphs with n vertices and at most r cycles, and all such graphs that are also connected. In addition, we characterize the extremal graphs. This proves a strengthening of a conjecture of Goh and Koh [3]. We do the same for the maximum number of maximum independent sets, generalizing a theorem of Jou and Chang ...
متن کاملAn Alternative Proof of the Largest Number of Maximal Independent Sets in Connected Graphs Having at Most Two Cycles
G. C. Ying, Y. Y. Meng, B. E. Sagan, and V. R. Vatter [1] found the maximum number of maximal independent sets in connected graphs which contain at most two cycles. In this paper, we give an alternative proof to determine the largest number of maximal independent sets among all connected graphs of order n ≥ 12, which contain at most two cycles. We also characterize the extremal graph achieving ...
متن کامل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...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 53 شماره
صفحات -
تاریخ انتشار 2006