Open Journal of Discrete Mathematics
Vol.07 No.03(2017), Article ID:77461,14 pages
10.4236/ojdm.2017.73013
The Number of Maximal Independent Sets in Quasi-Tree Graphs and Quasi-Forest Graphs
Jenq-Jong Lin, Min-Jen Jou
Ling Tung University, Taichung, Taiwan
Copyright © 2017 by authors and Scientific Research Publishing Inc.
This work is licensed under the Creative Commons Attribution International License (CC BY 4.0).
http://creativecommons.org/licenses/by/4.0/
Received: May 21, 2017; Accepted: July 3, 2017; Published: July 6, 2017
ABSTRACT
A maximal independent set is an independent set that is not a proper subset of any other independent set. A connected graph (respectively, graph) G with vertex set is called a quasi-tree graph (respectively, quasi-forest graph), if there exists a vertex such that is a tree (respectively, forest). In this paper, we survey on the large numbers of maximal independent sets among all trees, forests, quasi-trees and quasi-forests. In addition, we further look into the problem of determining the third largest number of maximal independent sets among all quasi-trees and quasi-forests. Extremal graphs achieving these values are also given.
Keywords:
Maximal Independent Set, Quasi-Tree Graph, Quasi-Forest Graph, Extremal Graph
1. Introduction and Preliminary
Let be a simple undirected graph. An independent set is a subset S of V such that no two vertices in S are adjacent. A maximal independent set is an independent set that is not a proper subset of any other independent set. The set of all maximal independent sets of a graph G is denoted by and its cardinality by .
The problem of determining the largest value of in a general graph of order n and those graphs achieving the largest number was proposed by Erdös and Moser, and solved by Moon and Moser [1] . It was then studied for various families of graphs, including trees, forests, (connected) graphs with at most one cycle, (connected) triangle-free graphs, (k-)connected graphs, bipartite graphs; for a survey see [2] . Jin and Li [3] investigated the second largest number of among all graphs of order n; Jou and Lin [4] further explored the same problem for trees and forests; Jin and Yan [5] solved the third largest number of among all trees of order n. A connected graph (respectively, graph) G with vertex set is called a quasi-tree graph (respectively, quasi-forest graph), if there exists a vertex such that is a tree (respectively, forest). The concept of quasi-tree graphs was mentioned by Liu and Lu in [6] . Recently, the problem of determining the largest and the second largest numbers of among all quasi-tree graphs and quasi-forest graphs of order n was solved by Lin [7] [8] .
In this paper, we survey on the large numbers of maximal independent sets among all trees, forests, quasi-trees and quasi-forests. In addition, we further look into the problem of determining the third largest number of maximal independent sets among all quasi-trees and quasi-forests. Extremal graphs achieving these values are also given.
For a graph , the neighborhood of a vertex x is the set of vertices adjacent to x in G and the closed neighborhood is . The degree of x is the cardinality of , denoted by . For a set , the deletion of A from G is the graph obtained from G by removing all vertices in A and their incident edges. Two graphs and are disjoint if . The union of two disjoint graphs and is the graph with vertex set and edge set . is the short notation for the union of n copies of disjoint graphs isomorphic to G. Denote by a cycle with n vertices and a path with n vertices.
Throughout this paper, for simplicity, let .
Lemma 1.1 ( [9] ) For any vertex x in a graph G, .
Lemma 1.2 ( [10] ) If G is the union of two disjoint graphs and , then .
2. Survey on the Large Numbers of Maximal Independent Sets
In this section, we survey on the large numbers of maximal independent sets among all trees, forests, quasi-trees and quasi-forests. The results of the largest numbers of maximal independent sets among all trees and forests are described in Theorems 2.1 and 2.2, respectively.
Theorem 2.1 ( [10] [11] ) If T is a tree with vertices, then , where
Furthermore, if and only if , where
where is the set of batons, which are the graphs obtained from the basic path P of vertices by attaching paths of length two to the endpoints of P in all possible ways (see Figure 1).
Theorem 2.2 ( [10] [11] ) If F is a forest with vertices, then , where
Furthermore, if and only if , where
The results of the second largest numbers of maximal independent sets among all trees and forests are described in Theorems 2.3 and 2.4, respectively.
Theorem 2.3 ( [4] ) If T is a tree with vertices having , then , where
Furthermore, if and only if or , where and , are shown in Figure 2 and Figure 3, respectively.
Theorem 2.4 ( [4] ) If F is a forest with vertices having , then , where
Figure 1. The baton with .
Figure 2. The trees .
Figure 3. The trees and .
Furthermore, if and only if , where
The results of the third largest numbers of maximal independent sets among all trees and forests are described in Theorems 2.5 and 2.6, respectively.
Theorem 2.5 ( [5] ) If T is a tree with vertices having , , then , where
Furthermore, if and only if or , where are shown in Figure 4 and Figure 5, respectively.
Theorem 2.6 ( [12] ) If F is a forest with vertices having , , then , where
Furthermore, if and only if , where
Figure 4. The trees and .
Figure 5. The trees .
The results of the largest numbers of maximal independent sets among all quasi-tree graphs and quasi-forest graphs are described in Theorems 2.7 and 2.8, respectively.
Theorem 2.7 ( [7] ) If Q is a quasi-tree graph with vertices, then , where
Furthermore, if and only if or , where is shown in Figure 6.
Theorem 2.8 ( [7] )If Q is a quasi-forest graph with vertices, then , where
Furthermore, if and only if , where
The results of the second largest numbers of maximal independent sets among all quasi-tree graphs and quasi-forest graphs are described in Theorems 2.9 and 2.10, respectively.
Theorem 2.9 ( [8] )If Q is a quasi-tree graph with vertices having , then , where
Furthermore, if and only if , where
where is shown in Figure 7 and Figure 8.
Theorem 2.10 ( [8] )If Q is a quasi-forest graph with vertices having , then , where
Figure 6. The graph .
Figure 7. The graphs , .
Figure 8. The graphs , .
Furthermore, if and only if , where
where W is a bow, that is, two triangles having one common vertex.
A graph is said to be unicyclic if it contains exactly one cycle. The result of the second largest number of maximal independent sets among all connected unicyclic graphs are described in Theorems 2.11.
Theorem 2.11 ( [13] ) If U is a connected unicyclic graph of order with and , then , where
Furthermore, if and only if , where
where is shown in Figure 9.
3. Main Results
In this section, we determine the third largest values of among all quasi-tree graphs and quasi-forest graphs of order , respectively. Moreover, the extremal graphs achieving these values are also determined.
Theorem 3.1 If Q is a quasi-tree graph of odd order having , then . Furthermore, the equality holds if and only if , , where is shown in Figure 9.
Proof. It is straightforward to check that , . Let Q be a quasi-tree graph of odd order having such that is as large as possible. Then . If Q is a tree, by Theorems 2.1, 2.3 and , we have that
Figure 9. The graphs , .
. This is a contradiction.
Suppose that Q contains at least two cycles and x is the vertex such that is a tree. Then . By Lemma 1.1, Theorems 2.1 and 2.2, , which is a contradiction. We obtain that Q is a connected unicyclic graph, thus the result follows from Theorem 2.11.
Theorem 3.2 If Q is a quasi-tree graph of even order having , then . Furthermore, the equality holds if and only if , , , , , where , , and are shown in Figure 10.
Proof. It is straightforward to check that , and , . Let Q be a quasi-tree graph of even order having such that is as large as possible. Then . If Q is a tree, by Theorem 2.1, we have that . This is a contradiction, so Q contains at least one cycle. Let x be the vertex such that is a tree. Then x is on some cycle of Q, it follows that . In addition, by Lemma 1.1, Theorems 2.2 and 2.5, . We consider the following three cases.
Case 1. . If then is a forest with at most vertices, by Lemma 1.1, Theorems 2.1 and 2.2, . This is a contradiction. So we assume that .
• . There are 6 possibilities for graph Q. See Figure 11. Note that . By simple calculation, we have that for , a contradiction to .
• . Suppose that there exists an isolated vertex y in and , then . Hence there are 4 possibilities for graph Q. See Figure 12.
Note that , and . By simple calculation, we have , a contradiction to .
• . Since is a forest of odd order or even or-
Figure 10. The graphs , , and , .
Figure 11. The graphs , .
der , by Lemma 1.1, Theorems 2.1 and 2.2, we have . The equalities holding imply that and or . Hence we obtain that , .
Case 2. . If then is a forest with at most vertices, by Lemma 1.1, Theorems 2.2 and 2.3, we have that . This is a contradiction. So we assume that .
• . Suppose that , by Lemma 1.1, Theorems 2.3 and 2.4, we have that
Figure 12. The graphs , .
. The equalities holding imply that , that is, and . Hence we obtain that . Now we assume that . There are 7 possibilities for graph Q. See Figure 13.
Note that , and . By simple calculation, we have for , a contradiction to when . In addition, when , it follows that .
• . Suppose that , by Lemma 1.1, Theorems 2.3 and 2.4, we have that . The equalities holding imply that , that is, and . Hence we obtain that . Now we assume that . Since and , it follows that , , a contradiction to .
Case 3. . Since is a forest with at most vertices, by Lemma 1.1, Theorems 2.2 and 2.5, we have . The equalities holding imply that and or . For the case that , we obtain that , . For the other case that There are 7 possibilities for graph Q. See Figure 14.
Note that , and . By simple calculation, we have for , a contradiction to .
In the following, we will investigate the same problem for quasi-forest graphs.
Theorem 3.3 If Q is a quasi-forest graph of odd order having , then . Furthermore, the equality holds if and only if , , where is shown in Figure 15.
Figure 13. The graphs , .
Figure 14. The graphs , .
Figure 15. The graphs , .
Proof. It is straightforward to check that , . Let Q be a quasi-forest graph of odd order having such that is as large as possible. Then . If Q is a forest, by Theorem 2.2, we have that . This is a contradiction, so Q contains at least one cycle. Let x be a vertex such that is a forest. Then x is on some cycle of Q, it follows that and is a forest with at most vertices. By Lemma 1.1, Theorem2.2 and 2.6, we obtain that . We consider the following three ases.
Case 1. . If then is a forest with at most vertices, by Lemma 1.1 and Theorem 2.2, we have that . This is a con- tradiction. So we assume that . There are 9 possibilities for graph Q. See Figure 16.
Note that , , , , , . By simple calculation, we have , , a contradiction to .
Case 2. . If then is a forest with at most vertices, by Lemma 1.1, Theorems 2.2 and 2.4, we have that . This is a contradiction. So we assume that . There are 5 possibilities for graph Q. See Figure 17.
Note that , , . By simple calculation, we have , , a contradiction to .
Case 3. . Since is a forest with at most vertices, by Lemma 1.1, Theorems 2.2 and 2.6, we have that
. The equali-
Figure 16. The graphs , .
ties holding imply that and . There are 3 possibilities for graph Q. See Figure 18.
Note that . By simple calculation, we have , , a contradiction to .
Theorem 3.4 If Q is a quasi-forest graph of even order having , then . Furthermore, the equality holds if and
only if .
Proof. It is straightforward to check that . Let Q
be a quasi-forest graph of even order having such that is as large as possible. Then . If Q is a forest, by Theorems 2.2, 2.4, 2.6, 2.8 and 2.10, we have that . This is a contradiction, so Q contains a coponent with at least one cycle.
Let . Suppose that . Since is not a tree and , by Lemma 1.2, Theorems 2.2, 2.4 and 2.7, we have that
Figure 17. The graphs , .
Figure 18. The graphs , .
Figure 19. The graphs , .
which is a contradiction. Hence we obtain that s is even and .
Let x be the vertex in such that is a forest and be the number of components of . We consider the following two cases.
Case 1. . Then is a quasi-tree graph. Since
it follows that . By Lemma 1.2 and Theorem 2.9, it follows that . The equality holding
imply that . In conclusion, .
Case 2. . Then . In addition, suppose that has a isolated vertex or , by Lemma 1.1 and Theorem 2.2, we have that . This is a contradiction, hence, we have that and has no isolated vertex. For the case that , by Lemma 1.1, Theorems 2.2 and 2.4, we have that . The equa- lities holding imply that and . Since , there no such graph Q. For the other case that , there are 2 possibilities for graph Q. See Figure 19.
Note that and when . On the other hand, when , a contradiction to .
Cite this paper
Lin, J.-J. and Jou, M.-J. (2017) The Number of Maximal Independent Sets in Quasi-Tree Graphs and Quasi-Forest Graphs. Open Journal of Dis- crete Mathematics, 7, 134-147. https://doi.org/10.4236/ojdm.2017.73013
References
- 1. Moon, J.W. and Moser, L. (1965) On Cliques in Graphs. Israel Journal of Mathematics, 3, 23-28. https://doi.org/10.1007/BF02760024
- 2. Jou, M.J. and Chang, G.J. (1995) Survey on Conunting Maximal Independent Sets. In: Tangmance, S. and Schulz, E., Eds., Proceedings of the Second Asian Mathema-tical Conference, World Scientific, Singapore, 265-275.
- 3. Jin, Z. and Li, X. (2008) Graphs with the Second Largest Number of Maximal Independent Sets. Discrete Mathematics, 308, 5864-5870. https://doi.org/10.1016/j.disc.2007.10.032
- 4. Jou, M.J. and Lin, J.J. (2009) Trees with the Second Largest Number of Maximal Independent Sets. Discrete Mathematics, 309, 4469-4474. https://doi.org/10.1016/j.disc.2009.02.007
- 5. Jin, Z. and Yan, H.F. (2009) Trees with the Second and Third Largest Number of Maximal Independent Sets. Ars Combinatoria, 93, 341-351.
- 6. Liu, H. and Lu, M. (2008) On the Spectral Radius of Quasi-Tree Graphs. Linear Algebra and Its Applications, 428, 2708-2714. https://doi.org/10.1016/j.laa.2007.12.017
- 7. Lin, J.J. (2010) Quasi-Tree Graphs with the Largest Number of Maximal Independent Sets. Ars Combinatoria, 97, 27-32.
- 8. Lin, J.J. (2013) Quasi-Tree Graphs with the Second Largest Number of Maximal Independent Sets. Ars Combinatoria, 108, 257-267.
- 9. Sagan, B.E. and Vatter, V.R. (2006) Maximal and Maximum Independent Sets in Graphs with at Most Cycles. Journal of Graph Theory, 53, 283-314. https://doi.org/10.1002/jgt.20186
- 10. Jou, M.J. (1991) The Number of Maximal Independent Sets in Graphs. Master Thesis, Department of Mathematics, National Central University, Taiwan.
- 11. Jou, M.J. and Chang, G.J. (1997) Maximal Independent Sets in Graphs with at Most One Cycle. Discrete Applied Mathematics, 79, 67-73. https://doi.org/10.1016/S0166-218X(97)00033-4
- 12. Jou, M.J. and Lin, J.J. (2010) Forests with the Third Largest Number of Maximal Independent Sets. Ling Tung Journal, 27, 203-212.
- 13. Lin, J.J. and Jou, M.J. The Numbers of Maximal Independent Sets in Connected Unicyclic Graphs. Utilitas Math., to Appear.