Eigenvalues and edge-connectivity of regular graphs
|
|
- Margaret Cunningham
- 6 years ago
- Views:
Transcription
1 Eigenvalues and edge-connectivity of regular graphs Sebastian M. Cioabă University of Delaware Department of Mathematical Sciences Newark DE 19716, USA August 3, 009 Abstract In this paper, we show that if the second largest eigenvalue of a d-regular graph is less than d (k 1) d+1, then the graph is k-edge-connected. When k is or 3, we prove stronger results. Let ρ(d) denote the largest root of x 3 (d 3)x (3d )x = 0. We show that if the second largest eigenvalue of a d-regular graph G is less than ρ(d), then G is -edge-connected and we prove that if the second largest eigenvalue of G is less than d 3+ (d+3) 16, then G is 3-edge-connected. 1 Introduction Let κ(g) and κ (G) denote the vertex- and edge-connectivity of a connected graph G. If δ is the minimum degree of G, then 1 κ(g) κ (G) δ. Let L = D A be the Laplacian matrix of G, where D is the diagonal degree matrix and A is the adjacency matrix of G. We denote by 0 = µ 1 < µ µ n the eigenvalues of the Laplacian of G. The complement of G is denoted by G. A graph is called disconnected if it is not connected. The join G 1 G of two vertex-disjoint graphs G 1 and G is the graph formed from the union of G 1 and G by joining each vertex of G 1 to each vertex of G. A classical result in spectral graph theory due to Fiedler [7] states that κ(g) µ (G) (1) for any non-complete graph G. Fiedler called µ (G) the algebraic connectivity of G and his work stimulated a large amount of research in spectral graph theory over the last forty years (see [1, 11, 13, 15]). In [1], Kirkland, Molitierno, Neumann and Shader characterize the equality case in Fiedler s inequality (1). Research supported by a startup grant from the Department of Mathematical Sciences of the University of Delaware. 1
2 Theorem 1.1 (Kirkland-Molitierno-Neumann-Shader [1]). Let G be a non-complete connected graph on n vertices. Then κ(g) = µ (G) if and only if G = G 1 G where G 1 is a disconnected graph on n κ(g) vertices and G is a graph on κ(g) vertices with µ (G ) κ(g) n. Eigenvalue techniques have been also used recently by Brouwer and Koolen [5] to show that the vertex-connectivity of a distance-regular graph equals its degree (see also [, 4] for related results). In this paper, we study the relations between the edge-connectivity and the second largest eigenvalue of a d-regular graph. Let λ 1 (G) λ (G) λ n (G) denote the eigenvalues of the adjacency matrix of G. If G is d-regular graph, then λ i (G) = d µ i (G) for any 1 i n. Thus, λ 1 (G) = d and G is connected if and only if λ (G) < d. Chandran [6] proved that if G is a d-regular graph of order n and λ (G) < d 1 d, n d then κ (G) = d and the only disconnecting edge-cuts are trivial, i.e., d edges adjacent to the same vertex. Krivelevich and Sudakov [13] showed that λ (G) d implies κ (G) = d. If G is a d-regular graph on n vertices and n d + 1, then κ (G) = d regardless of the eigenvalues of G (see also the proof of Lemma 1.3). Both results are based on the following well-known lemma (see [15] for a short proof). Lemma 1.. If G = (V,E) is a connected graph of order n and S is a subset of vertices of G, then e(s,v \ S) µ S (n S ) n where e(s,v \ S) denotes the number of edges between S and V \ S. We extend and improve the previous results as follows. We prove the following sufficient condition for the k-edge-connectivity of a d-regular graph for any k d. Theorem 1.3. If d k are two integers and G is a d-regular graph such that λ (G) d (k 1)n, then (d+1)(n d 1) κ (G) k. When k = d, this result states that if λ (G) d (d 1)n, then (d+1)(n d 1) κ (G) = d. We get a small improvement for d even because κ (G) must be even in this case (see Lemma 3.1). (d )n When d is even, Theorem 1.3 shows that λ (G) d implies (d+1)(n d 1) κ (G) = d. A simple calculation reveals that these bounds improve the previous result of Chandran. When n d +, Theorem 1.3 implies that if G is a d-regular graph with λ (G) d + 4, then d+1 κ (G) = d. When d is even, the right hand-side of the previous inequality can be replaced by d + 6. These results improve the previous bound of Krivelevich and d+1 Sudakov. Note that there are many d-regular graphs G with d < λ (G) d + 4. d+1 An example is presented in Figure 1. For k {, 3} we further improve these results as shown below. Note that the edgeconnectivity of a connected, regular graph of even degree is even (see Lemma 3.1). Theorem 1.4. Let d 3 be an odd integer and ρ(d) denote the largest root of x 3 (d 3)x (3d )x = 0. If G is a d-regular graph such that λ (G) < ρ(d), then κ (G).
3 Figure 1: A 3-regular graph with 3 < λ = 1+ 5 < The value of ρ(d) is about d d+5. Theorem 1.5. Let d 3 be any integer. If G is a d-regular graph such that then κ (G) 3. λ (G) < d 3 + (d + 3) 16 The value of d 3+ (d+3) 16 is about d 4. d+3 We show that Theorem 1.4 and Theorem 1.5 are best possible in the sense that for each odd d 3, there exists a d-regular graph X d such that λ (X d ) = ρ(d) and κ (X d ) = 1. Also, for each d 3, there exists a d-regular graph Y d such that λ (Y d ) = d 3+ (d+3) 16 and κ (Y d ) =. The following result is an immediate consequence of Theorem 1.4 and Theorem 1.5. Corollary 1.6. If G is a 3-regular graph and λ (G) < 5.3, then κ (G) = 3. If G is 4-regular graph and λ < , then κ (G) = 4. Our results imply that if G is a 3-regular graph with λ (G) < 5, then κ(g) = 3. This is because for 3-regular graphs the vertex- and the edge-connectivity are the same. It is very likely that the eigenvalues results for κ(g) and κ (G) can be quite different. We comment on this in the last section of the paper. Proof of Theorem 1.3 In this section, we give a short proof of Theorem 1.3. Recall that a partition V 1 V l = V (G) of the vertex set of a graph G is called equitable if for all 1 i,j l, the number of neighbours in V j of a vertex v in V i is a constant b ij independent of v (see Section 9.3 of [8] or [9] for more details on equitable partitions). Proof of Theorem 1.3. We prove the contrapositive, namely we show that if G is a d-regular graph such that κ (k 1)n (G) k 1, then λ (G) > d. Let V (d+1)(n d 1) 1 V = V (G) be 3
4 a partition of G such that r = e(v 1,V ) k 1 d 1. Note that if V 1 d, then d 1 e(v 1,V ) V 1 (d V 1 + 1) d which is a contradiction. Thus, n i := V i d + 1 for each i = 1,. Since n 1 +n = n, this implies that n 1 n (d+1)(n d 1). The quotient matrix of the partition V 1 V = V (G) (see [8, 9, 10]) is [ d r A = r n n 1 r n 1 d r n The eigenvalues of A are d and d r n 1 r n. Eigenvalue interlacing (see [8, 9, 10]), r k 1 and n 1 n (d + 1)(n d 1) imply that ] () λ (G) d r n 1 r n d (k 1)n n 1 n d (k 1)n (d + 1)(n d 1) (3) We actually have strict inequality here. Otherwise, the partition V 1 V would be equitable. This would mean that each vertex of V 1 has the same number of neighbours in V which is impossible since there are vertices in V 1 without a neighbour in V. The proof is finished. 3 Proof of Theorem 1.4 In this section, we present the proof of Theorem 1.4. First, we show that any connected, regular graph of even degree has edge-connectivity larger than two. This follows from the next lemma. Lemma 3.1. Let G be a connected d-regular graph. If d is even, then κ (G) is even. Proof. Let V = A B be a partition of the vertex set of G such that e(a,b) = κ (G), where e(a,b) denotes the number of edges with one endpoint in A and one endpoint in B. Summing up the degrees of the vertices in A, we obtain that d A = e(a) + e(a,b) = e(a) + κ (G), where e(a) denotes the number of edges with both endpoints in A. Since d is even, this implies κ (G) is even which finishes the proof. For the rest of this section, we assume that d is an odd integer with d 3. We describe first the d-regular graph X d having κ (X d ) = 1 and λ (X d ) = ρ(d). If H 1,...,H k are pairwise vertex-disjoint graphs, then we define the product H 1 H H k recursively as follows. If k = 1, the product is H 1. If k =, then H 1 H is the usual join of H 1 and H, i.e. the graph formed from the union of H 1 and H by joining each vertex of H 1 to each vertex of H. If k 3, then H 1 H H k is the graph obtained by taking the union of H 1 H H k 1 and H k and joining each vertex of H k 1 to each vertex of H k. The extremal graph X d is defined as: X d = K M d 1 K 1 K 1 M d 1 K (4) where M d 1 is the unique (d 3)-regular graph on d 1 vertices (the complement of a perfect matching M d 1 on d 1 vertices). Figure shows X 3 and Figure 3 describes X 5. 4
5 The graph X d is d-regular, has d + 4 vertices and its edge-connectivity is 1. It has an equitable partition of its vertices into six parts which is described by the following quotient matrix X d. The sizes of the parts in this equitable partition are,d 1, 1, 1,d 1,. 1 d d X d = 0 d d 1 0 (5) d d 1 1 Next, we show that the second largest eigenvalue of X d equals the second largest eigenvalue of Xd. This will enable us to get sharp estimates for λ (X d ) which will be used later in this section. Figure : X 3 is 3-regular with λ (X 3 ) = ρ(3).7784 Lemma 3.. For each odd integer d 3, we have that λ (X d ) = λ ( X d ) = ρ(d). Proof. Since the partition with quotient matrix X d is equitable, it follows that the spectrum of X d contains the spectrum of Xd. Using Maple, we determine the characteristic polynomial of Xd : P Xd (x) = (x d)(x 1)(x + )(x 3 (d 3)x (3d )x ) (6) The roots of P Xd are d, 1, and the three roots of Q(x) = x 3 (d 3)x (3d )x. Denote by λ λ 3 λ 4 the roots of Q(x). Since these roots sum up to d 3 0 and their product is, it follows that λ is positive and both λ 3 and λ 4 are negative. Because Q(1) = 4d + 4 < 0, we deduce that λ > 1. Thus, λ ( X d ) = λ = ρ(d). Let W R d+4 be the subspace of vectors which are constant on each part of the six part equitable partition. The lifted eigenvectors corresponding to the six roots of P Xd form a basis for W. The remaining eigenvectors in a basis of eigenvectors for X d can be chosen to be perpendicular to the vectors in W. Thus, they may be chosen to be perpendicular to the characteristic vectors of the parts in the six-part equitable partition since these characteristic vectors form a basis for W. This implies that these eigenvectors will correspond to the non-trivial eigenvalues of the graph obtained as a disjoint union of K and M d 1. The corresponding eigenvalues will be ( ) (d 3), ( 1) (), 0 (d 1), where the exponent denotes the multiplicity of each eigenvalue. These d eigenvalues together with the six roots of P Xd form the spectrum of the graph X d. Thus, λ (X d ) = λ ( X d ) = ρ(d). 5
6 Figure 3: X 5 is 5-regular with λ (X 5 ) = ρ(5) Using Maple, we find that ρ(3).7784 and ρ(5) A simple algebraic manipulation shows that ρ(d) satisfies the equation d ρ(d) = d ρ (d) + 3ρ(d) + > d d + 3d +, (7) where the last inequality follows since ρ(d) < d. Using (7), we deduce that d d + 4 < ρ(d) < d d + 5 for d 5. We are now ready to prove Theorem 1.4. Proof of Theorem 1.4. We will prove the contrapositive, namely we will show that if G is a d-regular graph with edge connectivity 1 (containing a bridge), then λ (G) λ (X d ) = ρ(d). We also show that equality happens if and only if G = X d. Consider a connected d-regular graph G that contains a bridge x 1 x. Deleting the edge x 1 x partitions V (G) into two connected components G 1 and G such that x i V (G i ) for i = 1,. Let n i = V (G i ) for i = 1,. Without loss of generality, we assume from now on that n 1 n. The graph G 1 contains n 1 1 vertices of degree d and one vertex of degree d 1. Because d is odd, this implies that n 1 is odd. By symmetry, n is also odd. Thus, n n 1 d +. Note that G = X d if and only if n 1 = n = d +. Let A be the quotient matrix of the partition of V (G) into V (G 1 ) and V (G ). Then [ d 1 ] A = n 1 1 n 1 1 n d 1 n The eigenvalues of A are: d and λ (A ) = d 1 n 1 1 n. Let A 3 be the quotient matrix of the partition of V (G) into V (G 1 ), {x },V (G ) \ {x }. Then d a a 0 A 3 = 1 0 d 1 (10) 0 b d b where a = 1 n 1 and b = d 1 n 1 3 are d,λ (A 3 ) = d a b+ (d a+b) +4(a b),λ 3 (A 3 ) = d a b (d a+b) +4(a b). Taking partial derivatives with respect to a and to b respectively, we 6 (8) (9)
7 find that when d > 1, the eigenvalue λ (A 3 ) is strictly monotone decreasing with respect to both a and b and so is strictly monotone increasing with respect to both n 1 and n. We consider now a partition of V (G) into the following six parts: V (G 1 )\(x 1 N(x 1 )),N(x 1 )\ {x }, {x 1 }, {x },N(x ) \ {x 1 } and V (G ) \ (x N(x )). Here N(u) denotes the neighbourhood of vertex u in G. Let e 1 denote the number of edges between N(x 1 ) \ {x } and V (G 1 ) \ (x 1 N(x 1 )). Let e denote the number of edges between N(x ) \ {x 1 } and V (G ) \ (x N(x )). Note that e i (d 1)(n i d) for i = 1,. Let A 6 be the quotient matrix of the previous partition of V (G) into six parts. Then d e 1 e 1 n 1 d n d e 1 d 1 e d 1 d 1 A 6 = 0 d d 1 0 (11) d 1 e Eigenvalue interlacing (see [8, 9, 10]) implies that d 1 e d 1 e n d d e n d λ (G) max(λ (A ),λ (A 3 ),λ (A 6 )). (1) We will use this as well as the inequalities (7) and (8) to show that λ (G) λ (X d ) = ρ(d) and that equality happens if and only if G = X d. Recall that n n 1 d + and that d,n 1 and n are all odd. If n 1 d+6 and d 5, then we use the partition of V (G) into two parts whose quotient matrix A is given in (9). Using inequality (8), we have that λ (G) λ (A ) = d 1 n 1 1 n d d + 6 > ρ(d). If n 1 d+6 and d = 3, then we use the partition of V (G) into three parts whose quotient matrix A 3 is given in (10). We have that (3 λ (G) λ (A 3 ) ( 9 8) ) = >.84 > ρ(3). 7 If n n 1 = d + 4, then we use the partition of V (G) into three parts whose quotient matrix A 3 is shown in (10). We have that (d λ (G) λ (A 3 ) d 1 d 1 + d+4 d ) d 1 ( d+4 d ) d 1 d+4 d+3 = d3 + 6d + 8d d d d d 3 + 8d 96d (d + 7d + 1) = d3 + 6d + 8d (d 3 + 8d + 1d 9) + 8d + 10d (d + 7d + 1) 7
8 If d = 3, the right hand side of the previous inequality equals >.796 > ρ(3). When d 5, from the previous inequality and (8) we obtain that λ (G) d3 + 6d + 8d (d 3 + 8d + 1d 9) + 8d + 10d (d + 7d + 1) > d3 + 6d + 8d (d 3 + 8d + 1d 9) = d3 + 7d + 10d 4 (d + 7d + 1) d + 7d + 1 d + 4 = d d + 7d + 1 > d d + 5 > ρ(d) If n 1 = d + and n d + 6, then we use the partition of V (G) into three parts whose quotient matrix is is given in (10). We obtain that (d λ (G) λ (A 3 ) d 1 d 1 + d+ d ) d 1 ( d+ d ) d 1 d+ d+5 = d3 + 6d + 8d 3 + d d d d 3 4d + 56d + 39 (d + 7d + 10) When d = 3, the right hand side equals >.7835 > ρ(3). If 5 d 17, then from the previous identity, we deduce that λ (G) d3 + 6d + 8d 3 + (d 3 + 8d + 8d 5) 8d + 136d (d + 7d + 10) > d3 + 6d + 8d 3 + (d 3 + 8d + 8d 5) (d + 7d + 10) = d3 + 7d + 8d 4 d + 7d + 10 = d d + 5 > ρ(d). When d 19, from the previous inequality we obtain that λ (G) d3 + 6d + 8d 3 + (d 3 + 8d + 8d 6) + d 3 + 8d + 15d + 93 (d + 7d + 10) > d3 + 6d + 8d 3 + (d 3 + 8d + 8d 6) = d3 + 7d + 8d 4.5 (d + 7d + 10) d + 7d + 10 d = d d + 7d + 10 > d d d + 3d + > ρ(d). The only case which remains to consider is n 1 = d + and n = d + 4. In this case, e 1 = d 4,n d = 4 and e is an even integer with 4d 1 e 4d 4. Thus, 1 d d A 6 = 0 d d d 1 e e d 1 d 1 e d e 4 8
9 Let P A6 (x) denote the characteristic polynomial of A 6. Since each row sum of A 6 is d, it follows that d is a root of P A6 (x). Thus, P A6 (x) = (x d)p 5 (x). The second largest root of P A6 (x) is the largest root of P 5 (x). Using the results of [3] page 130, we observe that P 5 (x) equals the characteristic polynomial of the following matrix: d 1 d d 1 0 e d d e e d 1 n d Using Maple to divide P 5 (x) by the polynomial x 3 + (3 d)x + ( 3d)x, we obtain the quotient Q(x) = x 4d 4d de 3e x e and the remainder R(x) = (d e 4(d 1) d 1 )x + de +e +4d 4d. Thus, P 5 (x) = (x 3 + (3 d)x + ( 3d)x )Q(x) + (d e )x + de + 4d + e 4d. Because ρ(d) satisfies the equation x 3 + (3 d)x + ( 3d)x = 0, it follows that P 5 (ρ(d)) = (d e )ρ(d) + de + 4d + e 4d ( = e ρ(d) + d + 1 ) + (d )(ρ(d) d). Because d > ρ(d) > d 1 d+1, we deduce that P 5 (ρ(d)) < 0. (13) Assume that ρ(d) λ (A 6 ). Then ρ(d) is larger than any root of P 5 (x). This implies that P 5 (ρ(d)) = θ root of P 5 (ρ(d) θ) 0 which is a contradiction with (13). Thus, λ (G) λ (A 6 ) > ρ(d). Hence, λ (G) > ρ(d) whenever n d + 4. The last case to be considered is n 1 = n = d +. This means that G = X d and λ (G) = ρ(d) which finishes the proof. 4 Proof of Theorem 1.5 In this section we present the proof of Theorem 1.5. We describe first the d-regular graph Y d having κ (Y d ) = and λ (Y d ) = d 3+ (d+3) 16. Consider the graph H d = K d 1 K. It has d 1 vertices of degree d and two vertices of degree d 1. We construct Y d by taking two disjoint copies of K d 1 K and adding two disjoint edges between the vertices of degree d 1 in different copies of K d 1 K. Figure 4 describes Y 3 and Figure 5 shows Y 4. 9
10 Figure 4: Y 3 is 3-regular with λ (Y 3 ) = θ(3) = 5 The graph Y d is d-regular, has d + vertices and its edge-connectivity is. It has an equitable partition into four parts of sizes d 1,,,d 1 with the following quotient matrix: d 0 0 Ỹ d = d d 1 (14) 0 0 d The characteristic polynomial of this matrix equals P Yd (x) = (x d)(x + 1)(x + (3 d)x + (4 3d)) Thus, the eigenvalues of Ỹd are d, 1 and d 3± (d+3) 16. To simplify our notation, let θ(d) = d 3+ (d+3) 16. Note that θ(d) is the largest root of and T(x) = x + (3 d)x + (4 3d) (15) d 4 d + < θ(d) < d 4 d + 3. (16) Lemma 4.1. The second largest eigenvalue of Y d equals θ(d). Proof. Since the previous partition of V (Y d ) into four parts is equitable, it follows that the four eigenvalues of Ỹ d are also eigenvalues of Y d. Obviously, the second largest of the eigenvalues of Ỹ d is θ(d). By an argument similar to the one of Lemma 3., one can show that the other eigenvalues of Y d are ( 1) (d ) which implies the desired result. We are ready now to prove Theorem 1.5. Proof of Theorem 1.5. We will prove the contrapositive, namely we will show that among all d-regular graphs with edge-connectivity less than or equal to, the graph Y d has the smallest λ. Let G be a d-regular graph with κ (G). We will prove that λ (G) θ(d) with equality if and only if G = Y d. If κ (G) = 1, then Theorem 1.4, (8) and (16) imply that λ (G) ρ(d) d d 4 d+3 > θ(d). 10 (d 1) (d+1)(d+)
11 Figure 5: Y 4 is 4-regular with λ (Y 4 ) = θ(4) = If κ (G) =, then there exists a partition of V (G) into two parts V 1 and V such that e(v 1,V ) =. Let S 1 V 1 and S V denote the endpoints of the two edges between V 1 and V. We have that ( S 1, S ) {(1, ), (, ), (, 1)}. Let n i = V i for i {1, }. It is easy to see that n i d + 1 for each i {1, }. Note that n 1 = n = d + 1 is equivalent to G = Y d. Without loss of generality assume that n n 1 d + 1. If n 1 d + 3, consider the partition of V (G) into V 1 and V. The quotient matrix of this partition is [ d n 1 n 1 n d n and its eigenvalues are d and d n 1 n. Eigenvalue interlacing and n n 1 d+3 imply that λ (G) d n 1 n d 4. Using inequality (16), we obtain that λ d+3 (G) d 4 > θ(d) d+3 which finishes the proof of this case. If n 1 = d +, then we have a few cases to consider. If S 1 =, then e(s 1 ) = 0 or e(s 1 ) = 1. If e(s 1 ) = 0, consider the partition of V (G) into three parts: V 1 \ S 1,S 1,V. The quotient matrix of this partition is d d d 0 d d d n d n Its characteristic polynomial equals ( ) P 3 (x) = (x d) x d n + n dn d x (d n + n + dn d) dn dn If P (x) = x d n +n dn d dn ( where R(x) = dn +n d d n +d n 4 dn dn +n x d x (d n +n + dn d) dn, then ] P (x) = T(x) + R(x) ). The expression d n +d n 4 dn +n d is decreasing with n and thus it attains its maximum when n = d+. This maximum equals d3 +d 8 d +d+4 = 11
12 d 4(d+) < d 4. Thus, P ( d +d+4 d+ (θ(d)) = R(θ(d)) < dn +n d dn d 4 θ(d)) < 0 where d+ the last inequality follows from (16). This fact and eigenvalue interlacing imply that λ (G) > θ(d). If e(s 1 ) = 1, then we consider the same partition into three parts: V 1 \ S 1,S 1,V. The quotient matrix is the following d d 4 d 4 0 d d d n d n Its characteristic polynomial equals ( ) P 3 (x) = (x d) x d n + 4n dn d x d n + 4n + 8 6dn. dn dn If P (x) = x d n +4n dn d dn x d n +4n +8 6dn dn then P (x) = T(x) + R(x) ) ( where R(x) = (dn +n d) d n +dn n 4 dn dn +n x d. The expression d n +dn n 4 dn +n d decreases with n and thus, its maximum is attained at n = d +. This maximum equals d3 +3d 8 d +3d+4 = d 4(d+) < d 4. As before, the previous inequality and eigenvalue interlacing imply d +3d+4 d+ that λ (G) > θ(d). If S 1 = 1, then d must be even. Indeed, the subgraph induced by V 1 contains d + 1 vertices of degree d and one vertex of degree d. This cannot happen when d is odd. Thus, d is even and d 4. Consider the partition of G into three parts: V 1 \ S 1,S 1,V. The quotient matrix of this partition is d d d 0 d+1 d+1 d 0 0 n d n Its characteristic polynomial is ( ) P 3 (x) = (x d) x d n + n d x d n + d + 4n + 8 4dn (d + 1)n (d + 1)n If P (x) = x d n +n d (d+1)n x d n +d+4n +8 4dn, then where R(x) = dn +5n d d n +3dn 8n d 8 dn +5n d (d+1)n ( (d+1)n P (x) = T(x) + R(x) ) x. Because d 4, the expression d n +3dn 8n d 8 dn +5n d is decreasing with n and thus, its maximum is attained when n = d+. This maximum equals d3 +7d 4d 4 = d 1d+4 < d 4 d +7d+8 d +7d+8 interlacing imply λ (G) > θ(d). 1 d+. This fact and eigenvalue
13 Assume now that n 1 = d + 1. This implies that V 1 induces a subgraph isomorphic to K d 1 K and consequently, S 1 = and e(s 1 ) = 0. If n d + 3, then consider the partition of G into three parts: V 1 \ S 1,S 1,V. The quotient matrix of this partition is d 0 d n d n Its characteristic polynomial is If P (x) = x which implies that P 3 (x) = (x d) (d n ) x + + n d, then ( ) x (d n x + + ) d. n P (x) = T(x) + dn + n (n )x n P (θ(d)) = dn + n (n )θ(d) n The expression dn + n (n )θ(d) n is decreasing with n and therefore, its maximum is attained when n = d + 3. Thus, P (θ(d)) d + d 4 (d + 1)θ(d) d + 3 = (d + 1)( d 4 θ(d)) d+1 < 0. d + 3 This inequality and eigenvalue interlacing imply that λ (G) > θ(d). Thus, the remaining case is n 1 = d + 1 and n d +. If d is odd, then n d +. Otherwise, the sum of the degrees of the graph induced by V would equal d V = d(d + ) which is an odd number. This is impossible and thus, n = d + 1. This implies G = Y d. If n = d + and d is even, then we have a few cases to consider. If S = 1, then both vertices in S 1 are adjacent to the vertex a of S. Thus, a has exactly d neighbours in V which means there are 3 vertices of V which are not adjacent to a. Each of these three vertices has degree d and the only way this can happen is they form a clique and each of them is adjacent to the d neighbours of a in V. Using a degree argument, it also follows that the d neighbours of a in V induce a subgraph isomorphic to the complement of a perfect matching on d vertices M d. Using the notation from the previous section, it follows that G = K d 1 K K 1 M d K 3. The graph G has an obvious equitable partition into five parts whose quotient matrix is d d d d d 13
14 Its characteristic polynomial equals P 5 (x) = (x d)p 4 (x) where P 4 (x) = x 4 + ( d + 4)x 3 + ( 4d+4)x 8x+6d 1. Dividing P 4 (x) by T(x) we get that P 4 (x) = T(x)Q 4 (x)+r 4 (x) where Q 4 (x) = x + x 3 and R 4 (x) = 3x 3d. It follows that P 4 (θ(d)) = R 4 (θ(d)) = 3θ(d) 3d < 0. This fact and eigenvalue interlacing imply that λ (G) > θ(d). The case remaining is S =. If e(s ) = 0, then each vertex of S has exactly d 1 neighbours in V. Let S = {x,y }. If x and y are adjacent to the same d 1 vertices of V, then because V = n = d +, there is exactly one vertex of V outside the vertices of S and their d 1 common neighbours. This vertex cannot have degree d. Thus, this case cannot happen and therefore, both x and y have exactly d common neighbours in V. We call this set U. Let {u,w } = V \ ({x,y } U). Because x and y have d 1 neighbours in V, we may assume that x is adjacent to u and y is adjacent to w. A degree argument implies that u and w must be adjacent and both of them are adjacent to each vertex of U. Finally, the subgraph induced by U must be (d 4)-regular. The following is a five-part equitable partition of G: V 1 \ S 1,S 1,S,U, {u,w }. The quotient matrix of this partition is the following: d d d d d 1 Its characteristic polynomial equals P 5 (x) = (x d)p 4 (x) where P 4 (x) = x 4 +(5 d)x 3 +(10 5d)x +( 6d+7)x d. Dividing P 4 (x) by T(x) we get that P 4 (x) = T(x)Q 4 (x)+r 4 (x) where Q 4 (x) = x + x and R 4 (x) = x d. It follows that P 4 (θ(d)) = R 4 (θ(d)) = θ(d) d < 0. This and eigenvalue interlacing show that λ (G) > θ(d). The final case of our proof is e(s ) = 1. Because V \ S = d and both x and y have d neighbours in V \ S, it follows that x and y have at least d 4 common neighbours in V \ S. If x and y have at least d 3 common neighbours in V \ S, we deduce that there exists at least one vertex z of V \ S that is not adjacent to x nor y. The vertex z cannot have degree d since its only possible neighbours are in V \ (S {z}) which has size d 1. We conclude that x and y must have precisely d 4 common neighbours in V \ S. There are 4 remaining vertices a,b,c,d in V \ S and without loss of generality, assume that x is adjacent to both a and b and y is adjacent to both c and d. Each of the vertices a,b,c,d will be adjacent to every other vertex of V \ S. The degree constraint implies that the remaining d 4 vertices of V \ S induce a (d 6)-regular subgraph of G. Obviously, this argument shows this case is only possible when d 6. The following is a five-part equitable partition of G: V 1 \ S 1,S 1,S, {a,b,c,d },V \ (S {a,b,c,d } ). Its quotient matrix is the following: d d d d d 6 14
15 Its characteristic polynomial equals P 5 (x) = (x d)p 4 (x) where P 4 (x) = x 4 + ( d + 4)x 3 + ( 4d+6)x +( d 1)x+3d 6. Dividing P 4 (x) by T(x) we get that P 4 (x) = T(x)Q 4 (x)+ R 4 (x) where Q 4 (x) = x +x 1 and R 4 (x) = x. It follows that P 4 (θ(d)) = R 4 (θ(d)) = θ(d) < 0. This and eigenvalue interlacing imply that λ (G) > θ(d) which finishes our proof. 5 Some Remarks Any strongly regular graph of degree d 3 satisfies the condition λ d and thus, is d-edge-connected. The fact that the edge-connectivity of a strongly regular graph equals its degree, was observed by Plesńik in 1975 (cf. []). As mentioned in the introduction, much more is true, namely the vertex-connectivity of any distance-regular graph equals its degree (see [5]). It is known that any vertex transitive d-regular graph whose second largest eigenvalue is simple has λ (G) d and consequently, is d-edge-connected. In fact, any vertex transitive d-regular graph is d-edge-connected as shown by Mader in 1971 (see [14] or Chapter 3 of [8]). I expect that Theorem 1.4 and Theorem 1.5 can be extended to other values of edgeconnectivity and vertex-connectivity. For example, it seems that λ (G) d 1 implies κ(g). Note however that in many cases, Fiedler s bound κ(g) d λ cannot be improved. When k d and dk is even, consider the graph K d k+1 H where H is a (k d)-regular graph on k vertices. This graph is d-regular, has vertex connectivity k and its second largest eigenvalue equals d k. 6 Acknowledgments I am grateful to David Gregory, Edwin van Dam, Willem Haemers and an anonymous referee for many suggestions that have greatly improved the original manuscript. I thank Professor Nair Abreu, the organizers and the participants in the Spectral Graph Theory in Rio Workshop for their support and enthusiasm. References [1] N.M.M. de Abreu, Old and new results on algebraic connectivity of graphs, Linear Algebra and its Applications 43 (007), [] A.E. Brouwer, Spectrum and connectivity of a graph, CWI Quarterly 9 (1996), [3] A.E. Brouwer, A.M. Cohen and A. Neumaier, Distance Regular Graphs, Springer (1989). [4] A.E. Brouwer and W.H. Haemers, Eigenvalues and perfect matchings, Linear Algebra and its Applications, 395 (005), [5] A.E. Brouwer and J. Koolen, The vertex-connectivity of a distance-regular graph, European Journal of Combinatorics 30 (009),
16 [6] S.L. Chandran, Minimum cuts, girth and spectral threshold, Inform. Process. Lett. 89 (004), no. 3, [7] M. Fiedler, Algebraic connectivity of graphs, Czech. Math. J. 3 (1973), [8] C. Godsil and G. Royle, Algebraic Graph Theory, Springer 001. [9] W.H. Haemers, Eigenvalue techniques in design and graph theory, Ph.D. Thesis (1979), Eindhoven University of Technology. [10] W. Haemers, Interlacing eigenvalues and graphs, Linear Algebra and its Applications (1995) 6-8, [11] S. Hoory, N. Linial and A. Wigderson, Expander graphs and their applications, Bull. Amer. Math. Soc. (006) 46, [1] S. Kirkland, J.J. Molitierno, M. Neumann and B.L. Shader, On graphs with equal algebraic and vertex connectivity, Linear Algebra and its Applications 341 (00), [13] M. Krivelevich and B. Sudakov, Pseudo-random graphs, in More Sets, Graphs and Numbers, Bolyai Society Mathematical Studies 15 (006), [14] W. Mader, Minimale n-fach kantenzusammenhängende Graphen, Math. Ann. 191 (1971), 1-8. [15] B. Mohar, Some applications of Laplace eigenvalues of graphs, Graph Symmetry: Algebraic Methods and Applications, Eds. G. Hahn and G. Sabidussi, NATO ASI Ser. C 487, Kluwer, (1997),
Edge-Disjoint Spanning Trees and Eigenvalues of Regular Graphs
Edge-Disjoint Spanning Trees and Eigenvalues of Regular Graphs Sebastian M. Cioabă and Wiseley Wong MSC: 05C50, 15A18, 05C4, 15A4 March 1, 01 Abstract Partially answering a question of Paul Seymour, we
More informationRegular factors of regular graphs from eigenvalues
Regular factors of regular graphs from eigenvalues Hongliang Lu Center for Combinatorics, LPMC Nankai University, Tianjin, China Abstract Let m and r be two integers. Let G be a connected r-regular graph
More informationA Characterization of Distance-Regular Graphs with Diameter Three
Journal of Algebraic Combinatorics 6 (1997), 299 303 c 1997 Kluwer Academic Publishers. Manufactured in The Netherlands. A Characterization of Distance-Regular Graphs with Diameter Three EDWIN R. VAN DAM
More informationSome spectral inequalities for triangle-free regular graphs
Filomat 7:8 (13), 1561 1567 DOI 198/FIL138561K Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Some spectral inequalities for triangle-free
More informationThe non-bipartite graphs with all but two eigenvalues in
The non-bipartite graphs with all but two eigenvalues in [ 1, 1] L.S. de Lima 1, A. Mohammadian 1, C.S. Oliveira 2 1 Departamento de Engenharia de Produção, Centro Federal de Educação Tecnológica Celso
More informationA lower bound for the spectral radius of graphs with fixed diameter
A lower bound for the spectral radius of graphs with fixed diameter Sebastian M. Cioabă Department of Mathematical Sciences, University of Delaware, Newark, DE 19716, USA e-mail: cioaba@math.udel.edu Edwin
More informationOn decompositions of complete hypergraphs
On decompositions of complete hypergraphs Sebastian M Cioabă 1, Department of Mathematical Sciences, University of Delaware, Newar, DE 19716, USA André Kündgen Department of Mathematics, California State
More informationAn Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs
An Interlacing Approach for Bounding the Sum of Laplacian Eigenvalues of Graphs Tilburg University joint work with M.A. Fiol, W.H. Haemers and G. Perarnau Laplacian matrix Eigenvalue interlacing Two cases
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationToughness, connectivity and the spectrum of regular graphs
Outline Toughness, connectivity and the spectrum of regular graphs Xiaofeng Gu (University of West Georgia) Joint work with S.M. Cioabă (University of Delaware) AEGT, August 7, 2017 Outline Outline 1 Toughness
More informationApplicable Analysis and Discrete Mathematics available online at GRAPHS WITH TWO MAIN AND TWO PLAIN EIGENVALUES
Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.rs Appl. Anal. Discrete Math. 11 (2017), 244 257. https://doi.org/10.2298/aadm1702244h GRAPHS WITH TWO MAIN AND TWO PLAIN
More informationSpectral densest subgraph and independence number of a graph 1
Spectral densest subgraph and independence number of a graph 1 Reid Andersen (Microsoft Research, One Microsoft Way,Redmond, WA 98052 E-mail: reidan@microsoft.com) Sebastian M. Cioabă 2 (Department of
More informationThe least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 22 2013 The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices Ruifang Liu rfliu@zzu.edu.cn
More informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More informationSpectral Graph Theory
Spectral raph Theory to appear in Handbook of Linear Algebra, second edition, CCR Press Steve Butler Fan Chung There are many different ways to associate a matrix with a graph (an introduction of which
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationThe effect on the algebraic connectivity of a tree by grafting or collapsing of edges
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 855 864 www.elsevier.com/locate/laa The effect on the algebraic connectivity of a tree by grafting or collapsing
More informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationGraphs with given diameter maximizing the spectral radius van Dam, Edwin
Tilburg University Graphs with given diameter maximizing the spectral radius van Dam, Edwin Published in: Linear Algebra and its Applications Publication date: 2007 Link to publication Citation for published
More informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the
More informationJournal of Combinatorial Theory, Series B. Matchings in regular graphs from eigenvalues
Journal of Combinatorial Theory, Series B 99 (009) 87 97 Contents lists available at ScienceDirect Journal of Combinatorial Theory, Series B www.elsevier.com/locate/jctb Matchings in regular graphs from
More informationOn Hadamard Diagonalizable Graphs
On Hadamard Diagonalizable Graphs S. Barik, S. Fallat and S. Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A2 Abstract Of interest here is a characterization
More informationThe Interlace Polynomial of Graphs at 1
The Interlace Polynomial of Graphs at 1 PN Balister B Bollobás J Cutler L Pebody July 3, 2002 Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152 USA Abstract In this paper we
More informationBichain graphs: geometric model and universal graphs
Bichain graphs: geometric model and universal graphs Robert Brignall a,1, Vadim V. Lozin b,, Juraj Stacho b, a Department of Mathematics and Statistics, The Open University, Milton Keynes MK7 6AA, United
More informationBipartite graphs with five eigenvalues and pseudo designs
J Algebr Comb (2012) 36:209 221 DOI 10.1007/s10801-011-0331-3 Bipartite graphs with five eigenvalues and pseudo designs Ebrahim Ghorbani Received: 20 November 2010 / Accepted: 11 November 2011 / Published
More informationEigenvalues, random walks and Ramanujan graphs
Eigenvalues, random walks and Ramanujan graphs David Ellis 1 The Expander Mixing lemma We have seen that a bounded-degree graph is a good edge-expander if and only if if has large spectral gap If G = (V,
More informationStrongly Regular Decompositions of the Complete Graph
Journal of Algebraic Combinatorics, 17, 181 201, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Strongly Regular Decompositions of the Complete Graph EDWIN R. VAN DAM Edwin.vanDam@uvt.nl
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More informationExtremal H-colorings of graphs with fixed minimum degree
Extremal H-colorings of graphs with fixed minimum degree John Engbers July 18, 2014 Abstract For graphs G and H, a homomorphism from G to H, or H-coloring of G, is a map from the vertices of G to the vertices
More informationHanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS
Opuscula Mathematica Vol. 6 No. 006 Hanna Furmańczyk EQUITABLE COLORING OF GRAPH PRODUCTS Abstract. A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a
More informationA sequence of triangle-free pseudorandom graphs
A sequence of triangle-free pseudorandom graphs David Conlon Abstract A construction of Alon yields a sequence of highly pseudorandom triangle-free graphs with edge density significantly higher than one
More informationApplied Mathematics Letters
Applied Mathematics Letters (009) 15 130 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Spectral characterizations of sandglass graphs
More informationGraphs with few total dominating sets
Graphs with few total dominating sets Marcin Krzywkowski marcin.krzywkowski@gmail.com Stephan Wagner swagner@sun.ac.za Abstract We give a lower bound for the number of total dominating sets of a graph
More informationThe Reduction of Graph Families Closed under Contraction
The Reduction of Graph Families Closed under Contraction Paul A. Catlin, Department of Mathematics Wayne State University, Detroit MI 48202 November 24, 2004 Abstract Let S be a family of graphs. Suppose
More informationEnergy of Graphs. Sivaram K. Narayan Central Michigan University. Presented at CMU on October 10, 2015
Energy of Graphs Sivaram K. Narayan Central Michigan University Presented at CMU on October 10, 2015 1 / 32 Graphs We will consider simple graphs (no loops, no multiple edges). Let V = {v 1, v 2,..., v
More informationLinear Algebra and its Applications
Linear Algebra and its Applications xxx (2008) xxx xxx Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Graphs with three distinct
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 430 (2009) 532 543 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Computing tight upper bounds
More informationThe maximum size of a partial spread in H(4n + 1,q 2 ) is q 2n+1 + 1
The maximum size of a partial spread in H(4n +, 2 ) is 2n+ + Frédéric Vanhove Dept. of Pure Mathematics and Computer Algebra, Ghent University Krijgslaan 28 S22 B-9000 Ghent, Belgium fvanhove@cage.ugent.be
More informationAalborg Universitet. All P3-equipackable graphs Randerath, Bert; Vestergaard, Preben Dahl. Publication date: 2008
Aalborg Universitet All P-equipackable graphs Randerath, Bert; Vestergaard, Preben Dahl Publication date: 2008 Document Version Publisher's PD, also known as Version of record Link to publication from
More informationAn algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 2 (207) 205 27 An algebraic proof of the Erdős-Ko-Rado theorem for intersecting
More informationThe Colin de Verdière parameter, excluded minors, and the spectral radius
The Colin de Verdière parameter, excluded minors, and the spectral radius Michael Tait Abstract In this paper we characterize graphs which maximize the spectral radius of their adjacency matrix over all
More informationOn the distance signless Laplacian spectral radius of graphs and digraphs
Electronic Journal of Linear Algebra Volume 3 Volume 3 (017) Article 3 017 On the distance signless Laplacian spectral radius of graphs and digraphs Dan Li Xinjiang University,Urumqi, ldxjedu@163.com Guoping
More informationCospectrality of graphs
Linear Algebra and its Applications 451 (2014) 169 181 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Cospectrality of graphs Alireza Abdollahi
More informationGraphs with Large Variance
Graphs with Large Variance Yair Caro Raphael Yuster Abstract For a graph G, let V ar(g) denote the variance of the degree sequence of G, let sq(g) denote the sum of the squares of the degrees of G, and
More informationIndependent Transversals in r-partite Graphs
Independent Transversals in r-partite Graphs Raphael Yuster Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel Abstract Let G(r, n) denote
More informationUsing Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems Jan van den Heuvel and Snežana Pejić Department of Mathematics London School of Economics Houghton Street,
More informationAn Introduction to Spectral Graph Theory
An Introduction to Spectral Graph Theory Mackenzie Wheeler Supervisor: Dr. Gary MacGillivray University of Victoria WheelerM@uvic.ca Outline Outline 1. How many walks are there from vertices v i to v j
More informationBOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
Volume 115 No. 9 017, 343-351 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu BOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationExtension of Strongly Regular Graphs
Extension of Strongly Regular Graphs Ralucca Gera Department of Applied Mathematics Naval Postgraduate School, Monterey, CA 93943 email: rgera@nps.edu, phone (831) 656-2206, fax (831) 656-2355 and Jian
More informationHamiltonicity in Connected Regular Graphs
Hamiltonicity in Connected Regular Graphs Daniel W. Cranston Suil O April 29, 2012 Abstract In 1980, Jackson proved that every 2-connected k-regular graph with at most 3k vertices is Hamiltonian. This
More informationExtremal Graphs for Randić Energy
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 77 (2017) 77-84 ISSN 0340-6253 Extremal Graphs for Randić Energy Kinkar Ch. Das, Shaowei Sun Department
More informationMore Counterexamples to the Alon-Saks-Seymour and Rank-Coloring Conjectures
More Counterexamples to the Alon-Saks-Seymour and Rank-Coloring Conjectures Sebastian M. Cioabă Department of Mathematical Sciences University of Delaware Newark, DE 19716, USA cioaba@math.udel.edu Michael
More informationTilburg University. Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: Link to publication
Tilburg University Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: 2007 Link to publication Citation for published version (APA): Haemers, W. H. (2007). Strongly Regular Graphs
More informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
More informationTHE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1
THE EXTREMAL FUNCTIONS FOR TRIANGLE-FREE GRAPHS WITH EXCLUDED MINORS 1 Robin Thomas and Youngho Yoo School of Mathematics Georgia Institute of Technology Atlanta, Georgia 0-0160, USA We prove two results:
More informationVERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS
VERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS YI ZHANG, YI ZHAO, AND MEI LU Abstract. We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in
More informationProperties of θ-super positive graphs
Properties of θ-super positive graphs Cheng Yeaw Ku Department of Mathematics, National University of Singapore, Singapore 117543 matkcy@nus.edu.sg Kok Bin Wong Institute of Mathematical Sciences, University
More informationThe Singapore Copyright Act applies to the use of this document.
Title On graphs whose low polynomials have real roots only Author(s) Fengming Dong Source Electronic Journal of Combinatorics, 25(3): P3.26 Published by Electronic Journal of Combinatorics This document
More informationGraphs with Integer Matching Polynomial Roots
Graphs with Integer Matching Polynomial Roots S. Akbari a, P. Csikvári b, A. Ghafari a, S. Khalashi Ghezelahmad c, M. Nahvi a a Department of Mathematical Sciences, Sharif University of Technology, Tehran,
More informationGeneralized Pigeonhole Properties of Graphs and Oriented Graphs
Europ. J. Combinatorics (2002) 23, 257 274 doi:10.1006/eujc.2002.0574 Available online at http://www.idealibrary.com on Generalized Pigeonhole Properties of Graphs and Oriented Graphs ANTHONY BONATO, PETER
More informationSPECTRUM OF (k, r) - REGULAR HYPERGRAPH
SPECTRUM OF (k, r) - REGULAR HYPERGRAPH K Reji Kumar 1 and Renny P Varghese Abstract. We present a spectral theory of uniform, regular and linear hypergraph. The main result are the nature of the eigen
More informationThe Colin de Verdière parameter, excluded minors, and the spectral radius
The Colin de Verdière parameter, excluded minors, and the spectral radius arxiv:1703.09732v2 [math.co] 7 Nov 2017 Michael Tait Abstract In this paper we characterize graphs which maximize the spectral
More informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
More informationChromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz Jacob Fox Choongbum Lee Benny Sudakov Abstract For a graph G, let χ(g) denote its chromatic number and σ(g) denote
More informationAdvanced Topics in Discrete Math: Graph Theory Fall 2010
21-801 Advanced Topics in Discrete Math: Graph Theory Fall 2010 Prof. Andrzej Dudek notes by Brendan Sullivan October 18, 2010 Contents 0 Introduction 1 1 Matchings 1 1.1 Matchings in Bipartite Graphs...................................
More informationRELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS. Communicated by Ali Reza Ashrafi. 1. Introduction
Bulletin of the Iranian Mathematical Society Vol. 39 No. 4 (2013), pp 663-674. RELATIVE N-TH NON-COMMUTING GRAPHS OF FINITE GROUPS A. ERFANIAN AND B. TOLUE Communicated by Ali Reza Ashrafi Abstract. Suppose
More informationThe endomorphisms of Grassmann graphs
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn. ISSN 1855-3974 (electronic edn. ARS MATHEMATICA CONTEMPORANEA 10 (2016 383 392 The endomorphisms of Grassmann graphs Li-Ping Huang School
More informationARRANGEABILITY AND CLIQUE SUBDIVISIONS. Department of Mathematics and Computer Science Emory University Atlanta, GA and
ARRANGEABILITY AND CLIQUE SUBDIVISIONS Vojtěch Rödl* Department of Mathematics and Computer Science Emory University Atlanta, GA 30322 and Robin Thomas** School of Mathematics Georgia Institute of Technology
More informationDecomposing planar cubic graphs
Decomposing planar cubic graphs Arthur Hoffmann-Ostenhof Tomáš Kaiser Kenta Ozeki Abstract The 3-Decomposition Conjecture states that every connected cubic graph can be decomposed into a spanning tree,
More informationCONSTRUCTION OF DIRECTED STRONGLY REGULAR GRAPHS USING FINITE INCIDENCE STRUCTURES
CONSTRUCTION OF DIRECTED STRONGLY REGULAR GRAPHS USING FINITE INCIDENCE STRUCTURES OKTAY OLMEZ AND SUNG Y. SONG Abstract. We use finite incident structures to construct new infinite families of directed
More informationIn this paper, we will investigate oriented bicyclic graphs whose skew-spectral radius does not exceed 2.
3rd International Conference on Multimedia Technology ICMT 2013) Oriented bicyclic graphs whose skew spectral radius does not exceed 2 Jia-Hui Ji Guang-Hui Xu Abstract Let S(Gσ ) be the skew-adjacency
More informationPlanar Ramsey Numbers for Small Graphs
Planar Ramsey Numbers for Small Graphs Andrzej Dudek Department of Mathematics and Computer Science Emory University Atlanta, GA 30322, USA Andrzej Ruciński Faculty of Mathematics and Computer Science
More informationEulerian Subgraphs in Graphs with Short Cycles
Eulerian Subgraphs in Graphs with Short Cycles Paul A. Catlin Hong-Jian Lai Abstract P. Paulraja recently showed that if every edge of a graph G lies in a cycle of length at most 5 and if G has no induced
More informationSmall Cycle Cover of 2-Connected Cubic Graphs
. Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV 26505 Abstract Every 2-connected simple cubic graph of
More informationON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS
Discussiones Mathematicae Graph Theory 34 (2014) 127 136 doi:10.7151/dmgt.1724 ON THE NUMBERS OF CUT-VERTICES AND END-BLOCKS IN 4-REGULAR GRAPHS Dingguo Wang 2,3 and Erfang Shan 1,2 1 School of Management,
More informationDistance-regular graphs where the distance-d graph has fewer distinct eigenvalues
NOTICE: this is the author s version of a work that was accepted for publication in . Changes resulting from the publishing process, such as peer review, editing, corrections,
More informationEXACT DOUBLE DOMINATION IN GRAPHS
Discussiones Mathematicae Graph Theory 25 (2005 ) 291 302 EXACT DOUBLE DOMINATION IN GRAPHS Mustapha Chellali Department of Mathematics, University of Blida B.P. 270, Blida, Algeria e-mail: mchellali@hotmail.com
More informationCLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted
More informationThe Laplacian spectrum of a mixed graph
Linear Algebra and its Applications 353 (2002) 11 20 www.elsevier.com/locate/laa The Laplacian spectrum of a mixed graph Xiao-Dong Zhang a,, Jiong-Sheng Li b a Department of Mathematics, Shanghai Jiao
More informationSpectral results on regular graphs with (k, τ)-regular sets
Discrete Mathematics 307 (007) 1306 1316 www.elsevier.com/locate/disc Spectral results on regular graphs with (k, τ)-regular sets Domingos M. Cardoso, Paula Rama Dep. de Matemática, Univ. Aveiro, 3810-193
More informationAntoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS
Opuscula Mathematica Vol. 6 No. 1 006 Antoni Marczyk A NOTE ON ARBITRARILY VERTEX DECOMPOSABLE GRAPHS Abstract. A graph G of order n is said to be arbitrarily vertex decomposable if for each sequence (n
More informationarxiv: v2 [math.co] 4 Sep 2009
Bounds for the Hückel energy of a graph Ebrahim Ghorbani a,b,, Jack H. Koolen c,d,, Jae Young Yang c a Department of Mathematical Sciences, Sharif University of Technology, P.O. Box 11155-9415, Tehran,
More informationNordhaus-Gaddum Theorems for k-decompositions
Nordhaus-Gaddum Theorems for k-decompositions Western Michigan University October 12, 2011 A Motivating Problem Consider the following problem. An international round-robin sports tournament is held between
More informationOut-colourings of Digraphs
Out-colourings of Digraphs N. Alon J. Bang-Jensen S. Bessy July 13, 2017 Abstract We study vertex colourings of digraphs so that no out-neighbourhood is monochromatic and call such a colouring an out-colouring.
More informationSydney University Mathematical Society Problems Competition Solutions.
Sydney University Mathematical Society Problems Competition 005 Solutions 1 Suppose that we look at the set X n of strings of 0 s and 1 s of length n Given a string ɛ = (ɛ 1,, ɛ n ) X n, we are allowed
More informationDiscrete Mathematics. The average degree of a multigraph critical with respect to edge or total choosability
Discrete Mathematics 310 (010 1167 1171 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The average degree of a multigraph critical with respect
More informationarxiv: v1 [cs.ds] 2 Oct 2018
Contracting to a Longest Path in H-Free Graphs Walter Kern 1 and Daniël Paulusma 2 1 Department of Applied Mathematics, University of Twente, The Netherlands w.kern@twente.nl 2 Department of Computer Science,
More informationDivisible Design Graphs
Divisible Design Graphs Willem H. Haemers Department of Econometrics and Operations Research, Tilburg University, The Netherlands Hadi Kharaghani Department of Mathematics and Computer Science, University
More informationELA A LOWER BOUND FOR THE SECOND LARGEST LAPLACIAN EIGENVALUE OF WEIGHTED GRAPHS
A LOWER BOUND FOR THE SECOND LARGEST LAPLACIAN EIGENVALUE OF WEIGHTED GRAPHS ABRAHAM BERMAN AND MIRIAM FARBER Abstract. Let G be a weighted graph on n vertices. Let λ n 1 (G) be the second largest eigenvalue
More informationarxiv: v4 [math.gr] 17 Jun 2015
On finite groups all of whose cubic Cayley graphs are integral arxiv:1409.4939v4 [math.gr] 17 Jun 2015 Xuanlong Ma and Kaishun Wang Sch. Math. Sci. & Lab. Math. Com. Sys., Beijing Normal University, 100875,
More informationSpectral Characterization of Generalized Cocktail-Party Graphs
Journal of Mathematical Research with Applications Nov., 01, Vol. 3, No. 6, pp. 666 67 DOI:10.3770/j.issn:095-651.01.06.005 Http://jmre.dlut.edu.cn Spectral Characterization of Generalized Cocktail-Party
More informationGraphs determined by their (signless) Laplacian spectra
Electronic Journal of Linear Algebra Volume Volume (011) Article 6 011 Graphs determined by their (signless) Laplacian spectra Muhuo Liu liumuhuo@scau.edu.cn Bolian Liu Fuyi Wei Follow this and additional
More informationIntegrity in Graphs: Bounds and Basics
Integrity in Graphs: Bounds and Basics Wayne Goddard 1 Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 USA and Henda C. Swart Department of Mathematics, University of
More informationbe a path in L G ; we can associated to P the following alternating sequence of vertices and edges in G:
1. The line graph of a graph. Let G = (V, E) be a graph with E. The line graph of G is the graph L G such that V (L G ) = E and E(L G ) = {ef : e, f E : e and f are adjacent}. Examples 1.1. (1) If G is
More informationLecture 12: Introduction to Spectral Graph Theory, Cheeger s inequality
CSE 521: Design and Analysis of Algorithms I Spring 2016 Lecture 12: Introduction to Spectral Graph Theory, Cheeger s inequality Lecturer: Shayan Oveis Gharan May 4th Scribe: Gabriel Cadamuro Disclaimer:
More informationGraphs with prescribed star complement for the. eigenvalue.
Graphs with prescribed star complement for the eigenvalue 1 F. Ramezani b,a B. Tayfeh-Rezaie a,1 a School of Mathematics, IPM (Institute for studies in theoretical Physics and Mathematics), P.O. Box 19395-5746,
More informationConnectivity of Cayley Graphs: A Special Family
Connectivity of Cayley Graphs: A Special Family Joy Morris Department of Mathematics and Statistics Trent University Peterborough, Ont. K9J 7B8 January 12, 2004 1 Introduction Taking any finite group G,
More information