Common Independence in Graphs

: The cardinality of a largest independent set of G , denoted by α ( G ) , is called the independence number of G . The independent domination number i ( G ) of a graph G is the cardinality of a smallest independent dominating set of G . We introduce the concept of the common independence number of a graph G , denoted by α c ( G ) , as the greatest integer r such that every vertex of G belongs to some independent subset X of V G with | X | ≥ r . The common independence number α c ( G ) of G is the limit of symmetry in G with respect to the fact that each vertex of G belongs to an independent set of cardinality α c ( G ) in G , and there are vertices in G that do not belong to any larger independent set in G. For any graph G , the relations between above parameters are given by the chain of inequalities i ( G ) ≤ α c ( G ) ≤ α ( G ) . In this paper, we characterize the trees T for which i ( T ) = α c ( T ) , and the block graphs G for which α c ( G ) = α ( G ) .


Introduction
For notation and graph theory terminology we, in general, follow [1]. Specifically, let G = (V G , E G ) be a graph with vertex set V G and edge set E G . If A and B are disjoint sets of vertices of G, then we denote by E G (A, B) the set of edges in G joining a vertex in A with a vertex in B. For a vertex v of G, its neighborhood, denoted by N G (v), is the set of all vertices adjacent to v, and the cardinality of N G (v), denoted by d G (v), is called the degree of v. The closed neighborhood of v, denoted by N G [v], is the set N G (v) ∪ {v}. In general, for a subset X ⊆ V G of vertices, the neighborhood of X, denoted by N G (X), is defined to be v∈X N G (v), and the closed neighborhood of X, denoted by N G [X], is the set N G (X) ∪ X. A vertex of degree 0 is said to be isolated in G, while a vertex of degree one in G is called a leaf of G. The set of all leaves of G is denoted by L G . We define a pendant edge of a graph to be an edge incident with a leaf. The corona of graphs H and F is a graph H • F resulting from the disjoint union of H and |V H | copies of F in which each vertex v of H is adjacent to all vertices of the copy of F corresponding to v. The corona H • K 1 , in particular, is the graph obtained from H by adding exactly one pendant edge to each vertex of H. A graph G is said to be a corona if G is the corona H • K 1 of some graph H. It is obvious that a corona is a graph in which each vertex is a leaf or it is adjacent to exactly one leaf.
We denote the path, cycle, and complete graph on n vertices by P n , C n , and K n , respectively. The complete bipartite graph with one partite set of size n and the other of size m is denoted by K n,m . A star is the tree K 1,k for some k ≥ 1. For k, l ≥ 1, a double star S(k, l) is the tree with exactly two vertices that are not leaves, one of which has k leaf neighbors and the other l leaf neighbors.
A vertex v is called a simplicial vertex of G if N G [v] is a complete graph, while it is a cut vertex if G − v is disconnected. A block of a graph G is a maximal connected subgraph of G without its own cut vertices. We say that G is a block graph if every block of G is a complete graph (equivalently, every vertex of G is a simplicial or a cut vertex). A block of a block graph G is called a simplex if it contains at least one simplicial vertex of G, while it is an end block if it contains at most one cut vertex of G.
A subset D of V G is called a dominating set of G if every vertex belonging to V G − D is adjacent to at least one vertex in D. A subset I of V G is said to be independent if no two vertices belonging to I are adjacent in G. The cardinality of a largest (i.e., maximum) independent set of G, denoted by α(G), is called the independence number of G. Every largest independent set of a graph is called an α-set of the graph. The independent domination number of G, denoted by i(G), is the cardinality of a smallest independent dominating set of G (or equivalently, the cardinality of a minimum maximal independent set of vertices in G). The study of independent sets in graphs was begun by Berge [2,3] and Ore [4]. In 2013 Goddard and Henning published an article [5] that summarized results on independence domination in graphs. It is obvious that i(G) ≤ α(G) for any graph G. A graph G is a well-covered graph if i(G) = α(G). Equivalently, G is well-covered if every maximal independent set of G is a maximum independent set of G. The concept of well-covered graphs was introduced by Plummer [6] and extensively studied in many papers. We refer the reader to the excellent (but already old) survey on well-covered graphs by Plummer [7]. Now, between the integers i(G) and α(G), we insert another integer concerning the existence and cardinality of independent sets in G. Formally, we introduce the concept of the common independence number of a graph G, denoted by α c (G), as the greatest integer r such that every vertex of G belongs to some independent subset X of V G with |X| ≥ r. Thus, the common independence number of a graph G refers to numbers of mutually independent vertices of G, and it emphasizes the notion of the individual independence of a vertex of G from other vertices of G. The common independence number α c (G) of G is the limit of symmetry in G with respect to the fact that each vertex of G belongs to an independent set of cardinality α c (G) in G, and there are vertices in G that do not belong to any larger independent set in G. For possible applications of the three parameters i(G), α(G), and α c (G) we refer the reader to the newest survey by Majeed and Rauf [8] on different applications of graph theory in computer science and social networks. It follows immediately from the above definitions (see also Proposition 1) that i(G) ≤ α c (G) ≤ α(G) for any graph G. In the following section, we present the first properties of the common independence number. Then, in the next two sections, we characterize the family of trees T for which i(T) = α c (T), and the family of block graphs G such that α c (G) = α(G), respectively. (We remark that the family of well-covered graphs is a proper subfamily of each of the previously mentioned families.)

Preliminaries
For our studies of the common independence number of a graph, we begin from straightforward propositions and simple examples.
Proof. Certainly, we have α c (G) ≤ α(G), since, as it follows from the definition of α(G), every independent set of vertices of G has at most α(G) vertices. On the other hand, for every v ∈ V G , let I v be any maximal independent subset of V G that contains v. The maximality of I v implies that |I v | ≥ i(G). Consequently, α c (G) ≥ i(G). Proof. If i(G) = 1, then G has a vertex v that is adjacent to every other vertex of G. This implies that {v} is the only independent set in G that contains v. Hence α c (G) = 1. On the other hand, if α c (G) = 1, then i(G) = 1 by Proposition 1.

Proposition 3. If G is a non-empty graph, then
H is an empty graph, that is, a graph without vertices.
. Then I v ∪ {v} is a largest independent set in G that contains v. From this and from the definition of the common independence number it follows that α c To better recognize connections between the independent domination number i(G), the common independence number α c (G), and the independence number α(G), we begin with simple examples. It is obvious that i(K n ) = α c (K n ) = α(K n ) = 1 for every positive integer n. Similarly, if m and n are positive integers and m ≤ n, then i(K m,n ) = α c (K m,n ) = m ≤ α(K m,n ) = n. It is no problem to observe that i(P n ) = n/3 , α c (P n ) = n/2 , and α(P n ) = n/2 . Consequently, i(P n ) < α c (P n ) < α(P n ) if n = 2k + 1 and k ≥ 4. On the other hand we have i( Let G k be a graph obtained from the corona K 1,k • K 2 by inserting a new vertex into each non-pendant edge of K 1,k • K 2 , see Figure 1. Now it is easy to see that i( denotes a graph obtained from the double star S(k, l) by inserting a new vertex into its only non-pendant edge, then it is obvious that i(S * (k, l)) = 2, α c (S * (k, l)) = min{k, l} + 1, and α(S * (k, l)) = k + l + 1. From these examples it follows that the differences between numbers i(G), α c (G), and α(G) can be arbitrarily large.
The aim of the next theorem is to show for which positive integers m, n, and p satisfying the inequalities m ≤ n ≤ p there exists a graph G such that i(G) = m, α c (G) = n, and α(G) = p. This theorem again shows that the difference between the independence number and the common independence number as well as the difference between the common independence number and the independent domination number of a graph can be arbitrarily large.
Proof. Since the necessity is obvious from Propositions 1 and 2, we need only provide constructions to establish sufficiency.
If m = n = 1 ≤ p, then for K 1,p we have i(K 1,p ) = α c (K 1,p ) = 1 and α(K 1,p ) = p. Thus assume that 2 ≤ m ≤ n ≤ p, and let s = m/2 , t = m − s (= m/2 ). Let H 1 , H 2 , H 3 , and H 4 be disjoint totally disconnected graphs of order s, p − t, n − s, and t, respectively. Now, let G be a new graph constructed from the union H 1 ∪ H 2 ∪ H 3 ∪ H 4 by adding all possible edges between the vertices of H i and H i+1 , i = 1, 2, 3. It is easy to observe that the cardinality m, n, and p, respectively, are the only maximal independent sets of G. Consequently, i(G) = m and α(G) = p. In addition, because every vertex of G belongs to an independent set of cardinality at least n and no vertex in V H 1 ∪ V H 3 belongs to an independent set of cardinality greater than n, we have α c (G) = n. This completes the proof.

Graphs G with α(G) = α c (G)
In this section we consider graphs G for which α(G) = α c (G); in particular we provide a constructive characterization of block graphs G for which α(G) = α c (G). It follows from the next proposition that such graphs form the class of the α-excellent graphs, that is, the class of graphs G in which every vertex belongs to some largest independent set of G. Thus, we are interested in characterizations of the α-excellent graphs. The α-excellent trees were already studied in [9,10]. We extend their characterizations to the α-excellent block graphs, and we present some additional properties of the α-excellent trees.
Proof. Assume that G is an α-excellent graph. Then, by definition, every vertex of G belongs to an independent set of cardinality α(G) in G, and, therefore, α c (G) ≥ α(G). From this and from Proposition 1 it follows that α c (G) = α(G).
On the other hand, by definition, every vertex of G belongs to an independent set of cardinality (at least) α c (G). Thus, if α c (G) = α(G), then every vertex of G belongs to an independent set of cardinality α(G), and G is α-excellent.
In order to state and prove our characterization of the α-excellent block graphs, we present additional definitions and some preliminary results that we will need while proving the next two theorems. Let K n be a complete graph of order n ≥ 1 with vertex set {v 1 , . . . , v n }. If k 1 , . . . , k n are positive integers, then by K k 1 ,...,k n n we denote a graph obtained from the disjoint union of the complete graphs K n , K k 1 , . . . , K k n by joining each vertex v i of K n with each vertex of K k i for i = 1, . . . , n. The graph K k 1 ,...,k n n is said to be a general corona of K n and the subgraph of K k 1 ,...,k n n induced by the vertices v 1 , . . . , v n is called the body of K k 1 ,...,k n n . It is obvious that K k 1 ,...,k n n has the property stated in the next observation.

Observation 1.
A general corona K k 1 ,...,k n n is a well-covered graph, and α(K k 1 ,...,k n n ) = n. In addition, K k 1 ,...,k n n is a tree if and only if either n = k 1 = 1 or n = 2 and k 1 = k 2 = 1.
Let F be the family of graphs that: (1) contains every complete graph of order at least 2; and (2) is closed under attaching general coronas, that is, if a graph G belongs to F and H = K k 1 ,...,k n n is a general corona, then to F belongs every graph obtained from the disjoint union G ∪ H by adding n edges that join one vertex of G with the vertices forming the body of H. By E we denote the family (defined in [9]) of all trees belonging to F . Thus, K 2 belongs to E , and, if a graph G belongs to E and K is a complete graph of order 2, then to E belongs every graph obtained from the disjoint union G ∪ K by adding exactly one edge that joins a vertex of G with a vertex of K.
It is clear from the above definition that every graph belonging to the family F is a block graph. Figure 2 shows a block graph G belonging to F and a tree T that belongs to the subfamily E of F . . It is apparent that if I is an α-set of G , then I ∪ S is an independent set of G, and therefore α(G) ≥ |I ∪ S| = α(G ) + n. Thus assume that J is an α-set of G. Then J ∩ V G and J ∩ V H are independent sets of G and H, respectively. In addition it follows from Observation 1 that It remains to prove that G is α-excellent if and only if G is α-excellent. Assume first that G is α-excellent. Let x be a vertex of G , and let I x be an α-set of G that contains x. Since I x has at most n vertices in H (by Observation 1), I x and has at least α(G) − n = α(G ) vertices in G and x ∈ I x . This implies that G is an α-excellent graph. Now assume that G is α-excellent. Let y be a vertex of G. If y belongs to V G , and if I y is an α-set of G containing y, then I y ∪ S is an α-set of G containing y. Thus assume that y ∈ V H . If y is a simplicial vertex of G belonging to H, then without loss of generality we may assume that y ∈ S. Then I ∪ S is an α-set of G containing y, where I is any α-set of G . If y is in a body of H, say y = v i (for some i ∈ {1, . . . , n}), then I u ∪ (S − {v i }) ∪ {v i } is an α-set of G containing y, where u is any neighbor of v in G and I u an α-set of G containing u.
We are now in position to prove the main result of this section, a constructive characterization of the α-excellent block graphs. Theorem 2. Let G be a block graph of order n ≥ 2. Then the following statements are equivalent: Assume that G is a block graph of order at least 2 with n ≥ 1 blocks and α(G) = α c (G). We use induction on n to show that G ∈ F . If n = 1, then G is a complete graph, say G = K m (m ≥ 2), and certainly G ∈ F . Let G be a block graph with n ≥ 2 blocks and assume that every block graph G belongs to F if α(G ) = α c (G ) and G has n blocks, where 1 ≤ n < n. We first establish the following claim.

Claim 1. All simplices of G are pairwise vertex-disjoint.
Proof. Suppose that S 1 and S 2 are two distinct simplices of G containing a common vertex v. Let I v be a largest independent set of G that contains v. Then α(G) ≥ |I v | ≥ α c (G) = α(G).
On the other hand, let x and y be two simplicial vertices belonging to S 1 and S 2 , respectively. Then, since x is not adjacent to y and neither x nor y is adjacent to any vertex in I v − {v}, the set (I v − {v}) ∪ {x, y} is an independent set of G and |(I v − {v}) ∪ {x, y}| > |I v | = α(G), a contradiction which completes the proof of our claim. Claim 1 implies that the diameter d of G is greater than 2. Let P = (u 0 , u 1 , . . . , u d ) be a longest path without chords in G. Let B i be that block of G which contains u i and u i+1 , i = 0, . . . , d − 1. The choice of P and Claim 1 imply that the blocks B 0 , . . . , B d−1 are distinct, u 1 , . . . , u d−1 are cut vertices, while u 0 and u d are simplicial vertices belonging to the end blocks B 0 and B d−1 , respectively. Without loss of generality we assume that V B 1 = {u 1 , u 2 } ∪ {w 1 , . . . , w l }. (We remark that possibly V B 1 = {u 1 , u 2 }.) Since B 0 is a simplex and the blocks B 0 and B 1 share a vertex, B 1 is not a simplex (by Claim 1), and therefore each of the vertices w 1 , . . . , w l is a cut vertex. Let B 1 , . . . , B l be blocks distinct from B 1 containing the vertices w 1 , . . . , w l , respectively. The choice of P implies that B 1 , . . . , B l are end blocks in G and they are unique (by Claim 1). Let H denote the subgraph of G induced by the vertices belonging to the blocks B 0 , B 1 , . . . , B l . It is obvious that H is a Since G can be obtained from G by (re)attaching the general corona H to the vertex u 2 in G , it follows from the second part of Proposition 5 that α c (G ) = α(G ). Thus, since G has n blocks, where 1 ≤ n < n, G belongs to F by the inductive hypothesis. Consequently, G belongs to F (since G can be obtained from G by attaching a general corona to a vertex in G ).
In the following theorem (which partially follows from Theorem 2) we prove the equivalent properties that characterize the trees T with α(T) = α c (T), that is, the αexcellent trees. Proof. The equivalence of (a) and (b) was proved in [9]. The statements (b), (e), and (f) are equivalent by Theorem 2. In [10] it was proved that (c) and (e) are equivalent. The statements (c) and (d) are equivalent: If M is a perfect matching in T, then the subgraphs of T generated by single edges belonging to M form the desired forest (with the smallest number of edges). On the other hand if T has a spanning forest F in which every component is the corona of a tree, then the set of all pendant edges of F forms a perfect matching of T. This completes the proof.

Graphs G with i(G) = α c (G)
In this section we are interested in recognizing the structure of trees in which the independence number i and the common independence number α c are equal. In order to do this, we recall that a graph G is a well-covered graph if every maximal independent set of vertices of G is a largest independent set of G. Equivalently, G is well-covered if and only if i(G) = α(G). We begin with some basic observations on well-covered graphs. The first one follows directly from the definition of a well-covered graph. The second one-the characterization of well-covered trees-was proved by Ravindra [11].

Remark 1.
A graph G is well-covered if and only if every set of independent vertices of G is a subset of a largest independent set of G.

Lemma 1 ([11]). A tree T is well-covered if and only if it is K 1 or it is a corona of a tree.
In the next lemma we present a general property of the graphs G for which i(G) = α c (G).
for every x ∈ V G , and consequently by Proposition

contradiction. From this contradiction and from the fact that
) and this implies our claim. Figure 3 illustrate that if G is a graph in which i(G) = α c (G), then it follows from Lemma 2 that G has at least one vertex z (the white and solid black vertices) such that G − N G [z] is a well-covered graph, but only for some of them (the solid black vertices) the equalities We are now in position to present our characterization of trees for which the independence number i and the common independence number α c are equal. (1) T is a star;

Remark 2. Graphs in
(2) T is the corona of a tree; (3) T has a vertex z such that is the set of leaves of trees of order at least 4 in Proof. Assume that T is a tree and i(T) = α c (T). It is obvious that if i(T) = α c (T) = 1, then T is a star, T = K 1,n , where n is a non-negative integer. Thus assume that i(T) = α c (T) ≥ 2 and T is not a corona graph. Then it follows from Lemma 2 that T has a vertex z such that T − N T [z] is a well-covered graph and i( is a well-covered forest, and, consequently, each component of T − N T [z] is the corona of a tree (that is, its pendant edges form a perfect matching, see [7,11]) or an isolated vertex.
Let U and V denote the set N T (z) ∩ L T and N T (z) − U, respectively. We divide the set V into two sets V 1 and V 2 , where By Z 1 , Z 2 , and Z 12 we denote the sets N T (V 1 ) ∩ V F 1 , N T (V 2 ) ∩ V F 2 , and N T (V 1 ) ∩ V F 12 , respectively. Figure 4 shows a tree T, the subsets U, V 1 , V 2 , Z 1 , Z 2 , Z 12 , and the subgraphs F 1 , F 2 , and F 12 of the well-covered forest Assume that E T (N T (z), L T ∪ L 4 F ) = ∅. Then the set V 1 is non-empty. Now, since and we shall prove that |U| > |Z 1 | − |V 1 |. Suppose to the contrary that |U| ≤ |Z 1 | − |V 1 |. Let I be a maximal independent set of F. Then I ∪ {z} is a maximal independent set of T and therefore we have i(T) ≤ |I ∪ {z}| = i(F) + 1. Now let I 1 , I 2 , and I 12 be sets such that I 1 is a maximal independent set of F 1 that contains Z 1 ∪ {x ∈ V F 1 : d T (x, Z 1 ) = 2}, I 2 is a maximal independent set of F 2 that contains Z 2 , and I 12 is a maximal independent set of F 12 that contains N T (Z 12 ) ∩ V F 12 , respectively. The existence of such sets I 1 , I 2 , and I 12 follows from Remark 1. Certainly, the set I 1 ∪ I 2 ∪ I 12 is a largest independent set of F. From the choice of I 1 , I 2 , and I 12 it is easy to observe that the set ( Assume that T is a tree which has one of the properties (1), (2), and (3). It is evident that if T is a star or a corona graph, then i(T) = α c (T). Thus assume that T is neither a star nor a corona graph, and T has a vertex z such that the subgraph F = T − N T [z] is a well-covered forest. Assume that i(F) = α(F) = α c (F) = m. We shall prove that i(T) = α c (T) = m + 1.
It is obvious that if I is a maximal independent set of F, then I ∪ {z} is a maximal independent set of T and therefore i(T) ≤ |I ∪ {z}| = m + 1. On the other hand, if we assume that every maximal independent set of T has at least m + 1 vertices, then m + 1 ≤ i(T), and, consequently, i(T) = m + 1. This implies that i(T) = α c (T) = m + 1 as m + 1 = i(T) ≤ α c (T) = min{α(F) : x ∈ V T } + 1 ≤ α(F) + 1 = m + 1. Hence, to prove that i(T) = α c (T) = m + 1, it suffices to show that every maximal independent set of T has at least m + 1 vertices. (In fact, it suffices to show that every smallest maximal independent set of T has at least m + 1 vertices.) For this, let U, V, V 1 , V 2 , Z 1 , Z 2 , Z 12 , F, F 1 , F 2 , and F 12 be the sets and graphs defined in the previous part of our proof.
Therefore assume that J is a maximal independent set of T. If J ∩ V = ∅, then the maximality of J implies that the sets J ∩ V F and J ∩ (U ∪ {z}) are non-empty, each of them is independent, and J = (J ∩ V F ) ∪ (J ∩ (U ∪ {z})). In addition, the maximality of J in T implies that N T [x] ∩ J = ∅ for every x ∈ V T . We shall prove that J ∩ V F is a maximal independent set in F, that is, we shall prove that This proves that J ∩ V F is a maximal independent set in the well-covered graph F. Thus |J ∩ V F | = m and finally |J| = |J ∩ V F | + |J ∩ (U ∪ {z})| ≥ m + 1. It remains to prove that |J| ≥ m + 1 if J ∩ V = ∅. Thus assume that J is a maximal independent set of T, where J ∩ V = ∅. In this case z ∈ J and U ⊂ J. We distinguish two cases: In this case the sets V 1 , Z 1 , and Z 12 are empty, while V = V 2 and V F = V F 2 are non-empty (as T is not a star). From the maximality of J it follows that Then either x is a non-leaf in F 2 or x belongs to a component of order 2 in F 2 , and, since F 2 is a well-covered forest, every component of F 2 is the corona of a tree, x is adjacent to exactly one leaf in T, say to x. Now, the maximality of J in T implies that the closed neighborhood N T [x] = {x, x} contains a vertex belonging to J in T. This immediately implies that the closed neighborhood N F 2 [x] contains a vertex belonging to J ∩ V F 2 in F 2 . This completes the verification of the maximality of J ∩ V F 2 in F 2 . Consequently, |J ∩ V F 2 | = m and |J| = |(J ∩ V F 2 ) ∪ (J ∩ V 2 ) ∪ U| ≥ |J ∩ V F 2 | + |J ∩ V 2 | ≥ m + 1.

Open Problems
We know that i(G) ≤ α c (G) ≤ α(G) for every graph G and we have characterized the trees T for which i(T) = α c (T) and the block graphs G for which α c (G) = α(G). In the light of these we have unsolved problems:

2.
Find lower and/or upper bounds for α c (G) for various classes of graphs G.