# SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

Save this PDF as:

Size: px
Start display at page:

Download "SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH"

## Transcription

1 31 Kragujevac J. Math. 25 (2003) SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur , W.B., India ; (Received August 28, 2003) Abstract. Let G = (V, E) be a simple graph with n vertices, e edges, and vertex degrees d 1, d 2,..., d n. Let d 1, d n be the highest and the lowest degree of vertices of G and m i be the average of the degrees of the vertices adjacent to v i V. We prove that d 2 i = e n 1 + n 2 if and only if G is a star graph or a complete graph or a complete graph with one isolated vertex. We establish the following upper bound for the sum of the squares of the degrees of a graph G: d 2 i e n 1 + (n 2) [ 4e d 1 n 1 2m 1 ] (n + 1) (n 1) d 1 + (n 1) with equality if and only if G is a star graph or a complete graph or a graph of isolated vertices. Moreover, we present several upper and lower bounds for n d 2 i and determine the extremal graphs which achieve the bounds and apply the inequalities to obtain bounds on the total number of triangles in a graph and its complement.,

2 32 1. INTRODUCTION Throughout this paper G = (V, E) will denote a simple undirected graph with n vertices and e edges. In order to avoid trivialities we always assume that n 2. Also assume that the vertices are labeled such that d 1 d 2... d n, where d i is the degree of the vertex v i for i = 1, 2,..., n. The average of the degrees of the vertices adjacent to v i is denoted by m i. We consider the following problem: find upper and lower bounds for n d 2 i in terms of n, e, d 1 and d n. We would like the bounds to be sharp, that is, we would like to show the existence of extremal graphs pertaining to the bounds. We recall some known upper bounds for n d 2 i. 1. Székely et al. [11]: 2. D. de Caen [2]: d 2 i ( d i ) 2. (1) d 2 i e( + n 2). (2) n 1 Caen pointed out that (1) and (2) are incomparable. He has also mentioned that the bound (2) is perhaps a bit more useful than (1), since it depends only on n and e rather than on the full-degree sequence. The rest of the paper is structured as follows. In Section 2, we find out the lower bound for the sum of squares of the degrees of a graph G in terms of n and e. In Section 3, we characterize the graphs for which the equality holds in (2) and also obtain some upper bounds for n di 2 in terms of n, e, d 1 and d n. In Section 4, we relate the Laplacian graph eigenvalues to the degree sequence of a graph G. In Section 5, we point out bounds on t(g) + t(g c ), where t(g) denotes the number of triangles in G and G c is the complement of G. Also we determine the extremal graphs which achieve the bounds on n d 2 i.

3 33 2. LOWER BOUND FOR n In this section we present two lower bounds for n d 2 i. d2 i Theorem 2.1. Let G be a simple graph with n vertices, and e edges. Then d 2 i (2p + 1) pn(1 + p), where p = [ n ], (3) and the equality holds if and only if the difference of the degrees of any two vertices of graph G is at most one. Here [x] denotes the greatest positive integer less than or equal to x. Proof. Consider two vertices, v i of degree d i and v j of degree d j, where d i d j. Also let n d 2 i be minimum. If possible, let d i d j 2. Therefore there exists a vertex v k, which is adjacent to v i, but not v j. If we remove the edge v k v i and add an edge between the vertices v k and v j, then the degree sequence of the new graph is d 1, d 2,..., d n ; where d i = d i 1, d j = d j + 1, d t = d t, t = 1, 2,..., n; t i, j. Therefore d 2 i = which is a contradiction as n d 2 i is minimum. = < d 2 i + (d i 1) 2 d 2 i + (d j + 1) 2 d 2 j d 2 i 2(d i d j 1) d 2 i, by d i d j + 2, Since v i and v j are arbitrary, therefore the difference of any two vertex degrees is at most one. So, some of the vertices have degree p and the remaining vertices (if any) have degree p + 1, where p = [ ]. Therefore ( pn) vertices have degree (p + 1). Hence n Min d 2 i = (2p + 1) pn(1 + p),

4 34 i.e., d 2 i (2p + 1) pn(1 + p), where p = [ n ]. Now suppose that the equality holds in (3). Therefore some of the vertices have degree p and the remaining vertices (if any) have degree p+1, where p = [ ]. Hence the difference n of the degrees of any two vertices of graph G is at most one. Conversely, suppose that the difference of the degrees of any two vertices of the graph G be at most one. Then we can easily see that the equality holds in (3). Lemma 2.2. Let G be a simple graph with n vertices, e edges and let d 1 be the highest vertex degree. If d i, i = 1, 2,..., n is the degree sequence of G, then d 2 i (2p + 1)( d 1 ) + d (d 1 n t) p(n 1)(p + 1) if d 1 > n 1 t, and d 2 i (2p + 1)( d 1 ) + d 2 1 p(n 1)(p + 1) if d 1 n 1 t, where p = [ 2(e d 1) (n 1) ] and t = 2(e d 1) p(n 1). Proof. Let v 1 be a highest degree vertex of the graph G. We remove the vertex v 1 and its corresponding edges and denote the resultant graph as G 1. Let d i, i = 1, 2,..., (n 1) be the degree sequence of G 1. From Theorem 2.1 we get that the minimum value of n d 2 i is attained in terms of n, e if and only if the difference of the degrees of any two vertices of graph G is at most one. Using this result we conclude that the value of n 1 d 2 i (in terms of the number of vertices and edges) will be minimum if the value of n d 2 i (in terms of n, e and d 1 ) is minimum. We have to find the minimum value of n d 2 i in terms of n, e and d 1. For this first we find the minimum value of n 1 d 2 i in terms of the number of vertices and edges. The graph G 1 has (n 1) vertices and (e d 1 ) edges. Using the above Theorem 2.1, we get n 1 d 2 i 2(e d 1 )(2p + 1) p(n 1)(1 + p), where p = [ 2(e d 1) n 1 ],

5 35 where p is the greatest positive integer less than or equal to 2(e d 1), and the difference of n 1 the degrees of any two vertices of graph G 1 is at most one. Let t = 2(e d 1 ) p(n 1). Therefore G 1 has t vertices of degree (p+1) and (n 1 t) vertices of degree p. Now we add the vertex v 1 of degree d 1 and join with edges to the vertices of graph G 1 such that n d 2 i is minimum. So, the vertex v 1 is connected to as many degree p vertices as possible and then to the remaining degree (p + 1) vertices till the d 1 degrees are exhausted. Two cases are (a) d 1 > n 1 t, (b) d 1 n 1 t. Case (a) d 1 > n 1 t. n 1 Min d 2 i = Min d 2 i + d p(n 1 t) + (n 1 t) + (d 1 n t) [(p + 2) 2 (p + 1) 2 ], i.e., d 2 i (2p + 1)( d 1 ) + d (d 1 n t) p(n 1)(p + 1), where p = [ 2(e d 1) (n 1) ] and t = 2(e d 1) p(n 1). Case (b) d 1 n 1 t. n 1 Min d 2 i = Min d 2 i + d d 1 (2p + 1), i.e., d 2 i (2p + 1)( d 1 ) + d 2 1 p(n 1)(p + 1), where p = [ 2(e d 1) (n 1) ]. Remark. The lower bounds obtained from Lemma 2.2 and (3) are the best possible because we can construct a graph for which equality holds. Theorem 2.3. Let G be a graph with n vertices and e edges. Then d 2 i d d 2 n + ( d 1 d n ) 2. (4) (n 2)

6 36 Moreover, equality in (4) holds if and only if d 2 = d 3 =... = d n 1. Proof. Let us take the degrees d 2, d 3,..., d n 1 with associated weights d 2, d 3,..., d n 1 ; then applying A.M. H.M., we get n 1 i=2 d 2 i n 1 i=2 d i n 1 i=2 d i (n 2), and equality holds if and only if d 2 = d 3 =... = d n 1. Therefore i.e., n 1 i=2 d 2 i ( n 1 i=2 d i ) 2 (n 2), d 2 i d d 2 n + ( d 1 d n ) 2, (n 2) and equality holds if and only if d 2 = d 3 =... = d n UPPER BOUND FOR n d2 i In this section we give some upper bounds for n d 2 i in terms of n, e, d 1, and d n. Let N i be the neighbor set of the vertex v i V and m 1 be the average degree of the highest degree vertex. Lemma 3.1. Let G be a graph with degree sequence d i, i = 1, 2,..., n and n d 2 i be maximum. If a vertex v 1 of maximum degree is not adjacent to some vertex v then d v = 0. Proof. If possible, let d v 0. Now we insert an edge vv 1 and drop an edge vv 2, where v 2 is adjacent to v as d v 0. The new value of the sum of squares of the vertex degrees is n d 2 i = [(d 1 + 1) 2 d 2 1] [d 2 2 (d 2 1) 2 ] = 2(d 1 d 2 + 1) > 0, which is a contradiction because n d 2 i was supposed to be maximum.

7 37 Hence the result. Corollary 3.2. Let G be a connected graph with n vertices and e edges. Then the highest degree of G is (n 1) if n d 2 i is maximum. Then Theorem 3.3. Let G be a graph with n vertices, e edges and n d 2 i be maximum. (i) N i {v j } = N j {v i } if and only if d i = d j, (ii) N i {v j } N j {v i } if and only if d i > d j, (iii) d j < d i if v i N k and v j {N k } c {v k }. where d i and d j are the degrees of any two vertices v i and v j, respectively. Proof. (i) Suppose that d i = d j. If possible, let N i {v j } = N j {v i }. Since d i = d j, there exists at least two vertices, v s, which is adjacent to v i but not v j and v t, which is adjacent to v j but not v i. Let d s and d t be the degrees of the vertices v s and v t, respectively. Two cases are (a) d s d t, (b) d s < d t. Case (a) d s d t. We remove an edge v j v t and add an edge between the vertices v j and v s. Let the degree sequence of the new graph be d 1, d 2,..., d n ; where d s = d s + 1, d t = d t 1, d i = d i, i = 1, 2,..., n; i s, t. Then d 2 i = = d 2 i + (d s + 1) 2 d 2 s + (d t 1) 2 d 2 t d 2 i + 2(d s d t + 1). From the above relation we get n d 2 i > n d 2 i, a contradiction.

8 38 Case (b) d s < d t. In this case we remove an edge v i v s and add an edge between the vertices v i and v t. Similarly, we arrive at a contradiction. Therefore N i {v j } = N j {v i }. Conversely, let N i {v j } = N j {v i }. Therefore d i = d j. (ii) Suppose that d i > d j. If possible, let N i {v j } N j {v i }. Therefore there exists a vertex v s, v s N j {v i } but v s / N i {v j }. We remove an edge v s v j and add an edge between the vertices v s and v i. Then the degree sequence of the new graph is d i = d i + 1, d j = d j 1, and d t = d t, i = 1, 2,..., n; t i, j. Then d 2 i = = > d 2 i + (d i + 1) 2 d 2 i + (d j 1) 2 d 2 j d 2 i + 2(d i d j + 1). d 2 i, (since d i > d j ), a contradiction. Therefore N i {v j } N j {v i }. Conversely, let N i {v j } N j {v i }. Therefore d i > d j. (iii) If possible, let d j d i. Using (i) and (ii), we get N i {v j } N j {v i }. Since v i N k, v i v k E. We have N j {v i } N i {v j } {v k }. Therefore v k N j {v i } implies that v j v k E. Since v j {N k } c {v k }, then v j v k / E, a contradiction. Hence the Theorem. Lemma 3.4. [2] Let G be a simple graph with n vertices and e edges. Then d 2 i e n 1 + n 2. (5)

9 39 Theorem 3.5. Let G be a connected graph with n vertices and e edges. Then d 2 i = e n 1 + n 2 if and only if G is a star graph or a complete graph. Proof. If G is a star graph or a complete graph then the equality holds. Conversely, let d 2 i = e n 1 + n 2. When n = 2, G is a complete graph of order two as G is a connected graph. Now we are to prove that G is a star graph or a complete graph for n > 2. By Lemma 3.4 and the above result, we conclude that n d 2 i is maximum. Using Corollary 3.2 we conclude that the highest degree of G is n 1. Now we delete a highest degree vertex and the corresponding edges from G. Let the degree sequence of G be d 1 = (n 1), d 2, d 3,...,d n. Therefore the degree sequence of the new graph is d 1 = d 2 1, d 2 = d 3 1,...,d n 1 = d n 1. Therefore n 1 d 2 i = d 2 i + (n 1) 2 + 4(e n + 1) + (n 1) i.e., i.e., = n 1 d 2 i + n 2 + 4e 5n + 4, 2(e n + 1) e n 1 + n 2 (e n + 1) + n 3 + n 2 + 4e 5n + 4, n 2 2 (n 1)(n 2) (n + 2) n(n 1) e (n 2) (n 2), i.e., 2 (n 1)(n + 2)e + n(n 1) 2 0, by n > 2, i.e., [e (n 1)][ n(n 1)] 0. (6)

10 40 From (6) we conclude that either e n 1 or e n(n 1) 2. Since G is a connected graph, n 1 e n(n 1) 2. Therefore either e = n 1 or e = n(n 1) 2. When e = n 1, G is a star graph as d 1 = n 1. When e = n(n 1) 2, G is a complete graph. Theorem 3.6. Let G be a simple graph with n vertices and e (> 0) edges. Then d 2 i = e n 1 + n 2 if and only if G is a star graph or a complete graph or a complete graph with one isolated vertex. Proof. If G is a star graph or a complete graph or a complete graph with one isolated vertex, then the equality holds. Conversely, let d 2 i = e n 1 + n 2 We need to prove that G is a star graph or a complete graph or a complete graph with one isolated vertex. If G is a connected graph then the theorem is proved by the previous Theorem 3.5. It remains to examine the case when G is a disconnected graph. For a disconnected graph we have to prove that G is a complete graph with one isolated vertex. Let G be a graph containing two connected components G 1 and G 2 with n 1, n 2 vertices and e 1 (> 0), e 2 (> 0) edges, respectively. Also let d 1i, i = 1, 2,..., n 1 and d 2i, i = 1, 2,..., n 2 be the degree sequence of the graphs G 1 and G 2, respectively. Therefore, n 1 [ ] d 2 1 1i e 1 n n 1 2. (7) and n 2 [ ] d 2 2 2i e 2 n n 2 2. (8) We have 1 /(n 1 1) 1 /(n 1 +n 2 1)+n 2 and 2 /(n 2 1) 2 /(n 1 +n 2 1)+n 1.

11 41 Therefore d 2 i = n 1 n 2 d 2 1i + d 2 2i 2 1 n 1 + n e 2 2 1n 2 + (n 1 2)e 1 + n 1 + n e 2n 1 + (n 2 2)e 2 2(e 1 + e 2 ) 2 n 1 + n (n 4e 1 e n 2 2)(e 1 + e 2 ) n 1 + n 2 1 < 2(e 1 + e 2 ) 2 n 1 + n (n 1 + n 2 2)(e 1 + e 2 ). (9) For the disconnected graph G, there are three possibilities: (i) there are at least two isolated vertices, (ii) no isolated vertex, (iii) exactly one isolated vertex. Case (i): Let k (k 2) be the number of isolated vertices in G. Then We have n n k d 2 i = [ d 2 i e ] n k 1 + n k 2, by (5). (10) d 2 i = e[ + n 2]. From this result and (10), we get e (n 1)(n n 1 k 1)/2. But e (n k)(n k 1)/2. From these two results k 1, a contradiction. Case (ii): Let there are no isolated vertices in G. In this case let there be p connected components in G. Therefore there is at least one edge in each component of G. Using (9) we conclude that n d 2 i < e[ + (n 2)], a contradiction. n 1 Case (iii): Let G contain only one isolated vertex. Then We have n n 1 d 2 i = d 2 i e n 2 + n 3, by (5). (11) d 2 i = e[ +n 2]. Using this result and (11), we get e (n 1)(n 2)/2. n 1 But e (n 1)(n 2)/2. Therefore e = (n 1)(n 2)/2, that is, G is a complete graph with one isolated vertex. Hence the theorem.

12 42 Theorem 3.7. Let G be a simple graph with degree sequence d 1, d 2,..., d n. Then d 2 i e(e + 1). (12) Proof. We show that if (12) holds for the graph G with n vertices and e edges then it also holds for the new graph G 1, constructed by joining any two non-adjacent vertices, v r and v s, by an edge. Therefore d r + d s e. (13) G 1 has n vertices and e + 1 edges with degree sequence d 1, d 2,..., d n. Therefore d r = d r + 1, d s = d s + 1, and d i = d i, i = 1, 2,..., n; i r, s. We have d 2 i = d 2 i + 2(d r + d s + 1) e(e + 1) + 2(e + 1), by (13) = (e + 1)(e + 2). Therefore (12) holds for graph G 1. Also for the star graph S 1,n 1 of order n, the equality in (12) holds. The inequality in (12) also holds for the graph constructed by adding an isolated vertex to the graph G. Any graph G can be constructed by starting with the star graph S 1,d1 (d 1, the highest degree) and making required constructions (addition of edges and vertices) at each step of which (12) holds true. Hence the theorem is proved for any graph G. Theorem 3.8. Let G be a connected graph with n vertices and e edges. Then d 2 i n n(n 1)d n + (d n 1), (14) where d n is the lowest degree. Moreover, the equality holds if and only if G is a star graph or a regular graph.

13 43 Proof. We have n d 2 i = n d i m i, where m i is the average degree of the adjacent vertices of the vertex v i V. We have d i m i d i (n d i 1)d n and the equality holds if and only if d i = n 1 or vertex v i is not adjacent to the d n degree vertices. Using this result, we get d 2 i [ d i (n d i 1)d n ] = n n(n 1)d n + (d n 1). Suppose now that equality in (14) holds. Then either d i = n 1 or d j = d n, for all v i V, v i v j / E, which implies that either (a) G is a star graph or (b) G is a regular graph. Conversely, it is easy to verify that equality in (14) holds for a star graph or a regular graph. Theorem 3.9 Let G be a graph with n vertices and e edges. Then d 2 i e n 1 + n 2 [ 4e d 1 n 1 2m 1 ] (n + 1) (n 1) d 1 + (n 1), (15) where d 1 is the highest degree and m 1 is the average degree of the vertices adjacent to the highest degree vertex. Moreover, equality in (15) holds if and only if G is a star graph or a complete graph or a graph of isolated vertices. Proof. Let v 1 be the highest degree vertex of degree d 1. Two cases are: (i) d 1 = n 1, (ii) d 1 < n 1. Case (i): d 1 = n 1. In this case m 1 = n+1. The inequality (15) reduces to n 1 which is true by (5). d 2 i e n 1 + n 2, (16)

14 44 Case (ii): d 1 < n 1. In this case all the vertices those are not adjacent to the vertex v 1 are adjacent to the vertex v 1. Denote the new graph by G 1. Also let d i, i = 1, 2,..., n be the degrees of G 1. By Lemma 3.4 on G 1, Now, i.e., d 2 2(e + n d1 1) i (e + n d 1 1) + n 2. (17) n 1 d 2 i d 2 i = (n 1) 2 d [ d 1 m 1 d 1 ] + (n d 1 1), [ ] 4e d 2 i e n 1 + n 2 d 1 n 1 2m (n + 1) 1 (n 1) d 1 + (n 1). Suppose that equality in (15) holds. Then the equality holds in either (16) or (17). Using Theorem 3.5 we conclude that G is either a star graph or a complete graph if the equality holds in (16). Since the graph G 1 is connected, using Theorem 3.5, G 1 is a star graph or a complete graph if the equality holds in (17). Since d 1 < n 1, G is a graph of isolated vertices if the equality holds in (17). Hence G is a star graph or a complete graph or a graph of isolated vertices. Conversely, it is easy to verify that equality in (15) holds for a star graph, a complete graph, and a graph of isolated vertices. Corollary 3.10 Let G be a graph with n vertices and e edges. Then d 2 i e n 1 + n 2 [ 4e d 1 n 1 2d 1 ] (n + 1) (n 1) d 1 + (n 1) Moreover, equality holds if and only if G is a complete graph or a graph of isolated vertices.. Remark. In the case of trees, the upper bound (15) is always better than D. Caen s bound, but it is not always so for any graph.

15 45 4. LAPLACIAN EIGENVALUE WITH DEGREE SEQUENCE Let A(G) be the adjacency matrix of G and let D(G) be the diagonal matrix of vertex degrees. The Laplacian matrix of G is L(G) = D(G) A(G). Clearly, L(G) is a real symmetric matrix. From this fact and Geršgorin s theorem, it follows that its eigenvalues are non-negative real numbers. Moreover, since its rows sum to 0, 0 is the smallest eigenvalue of L(G). The spectrum of G is S(G) = (λ 1 (G), λ 2 (G),..., λ n (G)), where λ 1 (G) λ 2 (G)... λ n (G) = 0 are the eigenvalues of L(G) arranged in nonincreasing order. We have and d i )d i = 2 ( d i d j, i j λ i )λ i = 2 ( λ i λ j. i j Since d i = λ i, from the above two relations follows, λ 2 i d 2 i = 2 d i d j 2 λ i λ j. i j i j From matrix theory is known that the sum of the product of two eigenvalues of L(G) is given by i j λ i λ j = i j d i d j e. Therefore λ 2 i = d 2 i +, that is, λ 2 i = d i (d i + 1).

16 46 Lemma 4.1. Let G be a graph. If we remove an edge v i v j then the maximum possible drop in eigenvalue λ k of L(G) is d i+d j +2 λ k, where d i and d j are the degrees of the vertices v i and v j, respectively. Proof. We have n 1 λ 2 i = d 2 i +. Also we know that if we remove an edge from the graph then the Laplacian eigenvalues of the graph are non-increasing. Let λ k be the drop of the k-th eigenvalue λ k of L(G). Then, n 1 k=1 (λ k λ k ) 2 = nk=1 d 2 k 2(d i + d j ) +. From these two results, we get i.e., 2 i.e., n 1 k=1 n 1 k=1 n 1 k=1 n 1 λ 2 k (λ k λ k ) 2 = 2(d i + d j ), k=1 n 1 λ k λ k ( λ k ) 2 = 2(d i + d j ), k=1 λ k λ k d i + d j + 2, by n k=1 ( λ k ) 2 4, i.e., λ k d i + d j + 2 λ k, k = 1, 2,..., (n 1). Example 4.2. Consider a graph G depicted in the Fig. 1. K p v i G v j K p Fig. 1 In G, v i and v j are two adjacent vertices connected by edges to one vertex each of the two complete graphs of order p. Therefore the highest degree of G is p. If we remove

17 47 an edge v i v j then using Lemma 4.1 the largest eigenvalue can drop by a maximum of 6 λ 1, where λ 1 is the largest eigenvalue of G. Therefore λ 1 6 λ 1, i.e., λ 1 = λ 1 λ 1 λ 1 6 λ 1, i.e., p + 1 λ 1 6, (since λ 1 = p + 1), λ 1 i.e., λ 1 (p + 1) + (p + 1) , 2 which is an upper bound for λ 1 of the graph G. Also this bound gives a better result than the other bounds (Section 1, [3]) for p > 4. Lemma 4.3. [10] If G is a simple connected graph, then λ 1 (G) d n (d n 1 2 )2 + d i (d i d n ). Equality holds if and only if G is a star graph [see [1], p. 283] or a regular bipartite graph. In [7] is shown that for a connected graph G with n > 1, λ 1 d Moreover, equality holds if and only if d 1 = n 1. Theorem 4.4. Let G be a simple connected graph with n vertices and e edges. Then d 2 i (d 1 d n ) 2 + d 1 + d n ( d n ), (18) Euality in (18) holds if and only if G is a star graph. Proof. We have λ 1 (G) d 1 + 1, where d 1 is the highest degree of G. From Lemma 4.3 and using this result, we get d 2 i (d 1 d n ) 2 + d 1 + d n ( d n ).

18 48 Moreover, we can easily determine that the equality holds in (18) if and only if G is a star graph. 5. APPLICATION Let t(g) denote the number of triangles in G. It was first observed by Goodman [4] that t(g) + t(g c ), where G c denotes the complement of G, is determined by the degree sequence: t(g) + t(g c ) = 1 [d i 2 v i V (n 1) ] n(n 1)(n 5). (19) 24 Goodman [5] raised the question of finding a best possible upper bound of the form t(g) + t(g c ) B(n, e), and he conjectured an expression for B(n, e). This conjecture was proved recently by Olpp [8]. Moreover, the expression of B(n, e) is rather complicated. We remark that two lower bounds and the four upper bounds on t(g) + t(g c ) follows from (3), (4) and (12), (14), (15), (17), respectively. References [1] R. A. Brualdi, From the Editor-in-Chief, Linear Algebra Appl. 360 (2003) [2] D. de Caen, An upper bound on the sum of squares of degrees in a graph, Discrete Math. 185 (1998) [3] K. C. Das, An improved upper bound for Laplacian graph eigenvalues, Linear Algebra Appl. 368 (2003) [4] A. W. Goodman, On sets of acquaintances and strangers at any party, Amer. Math. Monthly 66 (1959)

19 49 [5] A. W. Goodman, Triangles in a complete chromatic graph, J. Austral. Math. Soc. A 39 (1985) [6] L. Lovász, Combinatorial Problems and Exercises, North Holland, Amsterdam, [7] R. Merris, Laplacian matrices of graphs: A survey, Linear Algebra Appl (1994) [8] D. Olpp, A conjecture of Goodman and the multiplicities of graphs, Austral. J. Combin. 14 (1996) [9] Y. L. Pan, Sharp upper bounds for the Laplacian graph eigenvalues, Linear Algebra Appl. 355 (2002) [10] J. L. Shu, Y. Hong, K. W. Ren, A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph, Linear Algebra Appl. 347 (2002) [11] L. A. Székely, L. H. Clark, R. C. Entringer, An inequality for degree sequences, Discrete Math. 103 (1992)

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

### YILUN SHANG. e λi. i=1

LOWER BOUNDS FOR THE ESTRADA INDEX OF GRAPHS YILUN SHANG Abstract. Let G be a graph with n vertices and λ 1,λ,...,λ n be its eigenvalues. The Estrada index of G is defined as EE(G = n eλ i. In this paper,

### On Some Vertex Degree Based Graph Invariants

MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 65 (20) 723-730 ISSN 0340-6253 On Some Vertex Degree Based Graph Invariants Batmend Horoldagva a and Ivan

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### DATA ANALYSIS II. Matrix Algorithms

DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where

### Extremal Wiener Index of Trees with All Degrees Odd

MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 70 (2013) 287-292 ISSN 0340-6253 Extremal Wiener Index of Trees with All Degrees Odd Hong Lin School of

### Mean Ramsey-Turán numbers

Mean Ramsey-Turán numbers Raphael Yuster Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Abstract A ρ-mean coloring of a graph is a coloring of the edges such that the average

### Odd induced subgraphs in graphs of maximum degree three

Odd induced subgraphs in graphs of maximum degree three David M. Berman, Hong Wang, and Larry Wargo Department of Mathematics University of New Orleans New Orleans, Louisiana, USA 70148 Abstract A long-standing

### Divisor graphs have arbitrary order and size

Divisor graphs have arbitrary order and size arxiv:math/0606483v1 [math.co] 20 Jun 2006 Le Anh Vinh School of Mathematics University of New South Wales Sydney 2052 Australia Abstract A divisor graph G

### An inequality for the group chromatic number of a graph

An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

### Connectivity and cuts

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

### A simple criterion on degree sequences of graphs

Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree

### ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

### 10. Graph Matrices Incidence Matrix

10 Graph Matrices Since a graph is completely determined by specifying either its adjacency structure or its incidence structure, these specifications provide far more efficient ways of representing a

### Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

### Every tree contains a large induced subgraph with all degrees odd

Every tree contains a large induced subgraph with all degrees odd A.J. Radcliffe Carnegie Mellon University, Pittsburgh, PA A.D. Scott Department of Pure Mathematics and Mathematical Statistics University

### Cycles in a Graph Whose Lengths Differ by One or Two

Cycles in a Graph Whose Lengths Differ by One or Two J. A. Bondy 1 and A. Vince 2 1 LABORATOIRE DE MATHÉMATIQUES DISCRÉTES UNIVERSITÉ CLAUDE-BERNARD LYON 1 69622 VILLEURBANNE, FRANCE 2 DEPARTMENT OF MATHEMATICS

### Labeling outerplanar graphs with maximum degree three

Labeling outerplanar graphs with maximum degree three Xiangwen Li 1 and Sanming Zhou 2 1 Department of Mathematics Huazhong Normal University, Wuhan 430079, China 2 Department of Mathematics and Statistics

### Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices

MATHEMATICAL COMMUNICATIONS 47 Math. Commun., Vol. 15, No. 2, pp. 47-58 (2010) Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices Hongzhuan Wang 1, Hongbo Hua 1, and Dongdong Wang

### All trees contain a large induced subgraph having all degrees 1 (mod k)

All trees contain a large induced subgraph having all degrees 1 (mod k) David M. Berman, A.J. Radcliffe, A.D. Scott, Hong Wang, and Larry Wargo *Department of Mathematics University of New Orleans New

### Best Monotone Degree Bounds for Various Graph Parameters

Best Monotone Degree Bounds for Various Graph Parameters D. Bauer Department of Mathematical Sciences Stevens Institute of Technology Hoboken, NJ 07030 S. L. Hakimi Department of Electrical and Computer

### Sum of squares of degrees in a graph

Sum of squares of degrees in a graph Bernardo M. Ábrego 1 Silvia Fernández-Merchant 1 Michael G. Neubauer William Watkins Department of Mathematics California State University, Northridge 18111 Nordhoff

### Split Nonthreshold Laplacian Integral Graphs

Split Nonthreshold Laplacian Integral Graphs Stephen Kirkland University of Regina, Canada kirkland@math.uregina.ca Maria Aguieiras Alvarez de Freitas Federal University of Rio de Janeiro, Brazil maguieiras@im.ufrj.br

### SCORE SETS IN ORIENTED GRAPHS

Applicable Analysis and Discrete Mathematics, 2 (2008), 107 113. Available electronically at http://pefmath.etf.bg.ac.yu SCORE SETS IN ORIENTED GRAPHS S. Pirzada, T. A. Naikoo The score of a vertex v in

### An inequality for the group chromatic number of a graph

Discrete Mathematics 307 (2007) 3076 3080 www.elsevier.com/locate/disc Note An inequality for the group chromatic number of a graph Hong-Jian Lai a, Xiangwen Li b,,1, Gexin Yu c a Department of Mathematics,

### Product irregularity strength of certain graphs

Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (014) 3 9 Product irregularity strength of certain graphs Marcin Anholcer

### Degree Hypergroupoids Associated with Hypergraphs

Filomat 8:1 (014), 119 19 DOI 10.98/FIL1401119F Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Degree Hypergroupoids Associated

### Analysis of Algorithms, I

Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadth-first search (BFS) 4 Applications

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### The Independence Number in Graphs of Maximum Degree Three

The Independence Number in Graphs of Maximum Degree Three Jochen Harant 1 Michael A. Henning 2 Dieter Rautenbach 1 and Ingo Schiermeyer 3 1 Institut für Mathematik, TU Ilmenau, Postfach 100565, D-98684

### Finding and counting given length cycles

Finding and counting given length cycles Noga Alon Raphael Yuster Uri Zwick Abstract We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected

### Class One: Degree Sequences

Class One: Degree Sequences For our purposes a graph is a just a bunch of points, called vertices, together with lines or curves, called edges, joining certain pairs of vertices. Three small examples of

### Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

### Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = 36 + 41i.

Math 5A HW4 Solutions September 5, 202 University of California, Los Angeles Problem 4..3b Calculate the determinant, 5 2i 6 + 4i 3 + i 7i Solution: The textbook s instructions give us, (5 2i)7i (6 + 4i)(

### Week 5 Integral Polyhedra

Week 5 Integral Polyhedra We have seen some examples 1 of linear programming formulation that are integral, meaning that every basic feasible solution is an integral vector. This week we develop a theory

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### Total colorings of planar graphs with small maximum degree

Total colorings of planar graphs with small maximum degree Bing Wang 1,, Jian-Liang Wu, Si-Feng Tian 1 Department of Mathematics, Zaozhuang University, Shandong, 77160, China School of Mathematics, Shandong

### Graphical degree sequences and realizations

swap Graphical and realizations Péter L. Erdös Alfréd Rényi Institute of Mathematics Hungarian Academy of Sciences MAPCON 12 MPIPKS - Dresden, May 15, 2012 swap Graphical and realizations Péter L. Erdös

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

### Ph.D. Thesis. Judit Nagy-György. Supervisor: Péter Hajnal Associate Professor

Online algorithms for combinatorial problems Ph.D. Thesis by Judit Nagy-György Supervisor: Péter Hajnal Associate Professor Doctoral School in Mathematics and Computer Science University of Szeged Bolyai

### BOUNDARY EDGE DOMINATION IN GRAPHS

BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 0-4874, ISSN (o) 0-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 5(015), 197-04 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS BANJA

### Large induced subgraphs with all degrees odd

Large induced subgraphs with all degrees odd A.D. Scott Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, England Abstract: We prove that every connected graph of order

### Degree-associated reconstruction parameters of complete multipartite graphs and their complements

Degree-associated reconstruction parameters of complete multipartite graphs and their complements Meijie Ma, Huangping Shi, Hannah Spinoza, Douglas B. West January 23, 2014 Abstract Avertex-deleted subgraphofagraphgisacard.

### 2.1: Determinants by Cofactor Expansion. Math 214 Chapter 2 Notes and Homework. Evaluate a Determinant by Expanding by Cofactors

2.1: Determinants by Cofactor Expansion Math 214 Chapter 2 Notes and Homework Determinants The minor M ij of the entry a ij is the determinant of the submatrix obtained from deleting the i th row and the

### High degree graphs contain large-star factors

High degree graphs contain large-star factors Dedicated to László Lovász, for his 60th birthday Noga Alon Nicholas Wormald Abstract We show that any finite simple graph with minimum degree d contains a

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### Tenacity and rupture degree of permutation graphs of complete bipartite graphs

Tenacity and rupture degree of permutation graphs of complete bipartite graphs Fengwei Li, Qingfang Ye and Xueliang Li Department of mathematics, Shaoxing University, Shaoxing Zhejiang 312000, P.R. China

### GRAPH THEORY LECTURE 4: TREES

GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection

### The degree, size and chromatic index of a uniform hypergraph

The degree, size and chromatic index of a uniform hypergraph Noga Alon Jeong Han Kim Abstract Let H be a k-uniform hypergraph in which no two edges share more than t common vertices, and let D denote the

### U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory

### F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

### Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

### The Goldberg Rao Algorithm for the Maximum Flow Problem

The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }

### Tricyclic biregular graphs whose energy exceeds the number of vertices

MATHEMATICAL COMMUNICATIONS 213 Math. Commun., Vol. 15, No. 1, pp. 213-222 (2010) Tricyclic biregular graphs whose energy exceeds the number of vertices Snježana Majstorović 1,, Ivan Gutman 2 and Antoaneta

### (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular.

Theorem.7.: (Properties of Triangular Matrices) (a) The transpose of a lower triangular matrix is upper triangular, and the transpose of an upper triangular matrix is lower triangular. (b) The product

### NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1

NON-CANONICAL EXTENSIONS OF ERDŐS-GINZBURG-ZIV THEOREM 1 R. Thangadurai Stat-Math Division, Indian Statistical Institute, 203, B. T. Road, Kolkata 700035, INDIA thanga v@isical.ac.in Received: 11/28/01,

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

### Triangle deletion. Ernie Croot. February 3, 2010

Triangle deletion Ernie Croot February 3, 2010 1 Introduction The purpose of this note is to give an intuitive outline of the triangle deletion theorem of Ruzsa and Szemerédi, which says that if G = (V,

### Approximation Algorithms

Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH

CHAPTER 3 SEMITOTAL AND TOTAL BLOCK-CUTVERTEX GRAPH ABSTRACT This chapter begins with the notion of block distances in graphs. Using block distance we defined the central tendencies of a block, like B-radius

### CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

CS 598CSC: Combinatorial Optimization Lecture date: /4/010 Instructor: Chandra Chekuri Scribe: David Morrison Gomory-Hu Trees (The work in this section closely follows [3]) Let G = (V, E) be an undirected

### UNIT 2 MATRICES - I 2.0 INTRODUCTION. Structure

UNIT 2 MATRICES - I Matrices - I Structure 2.0 Introduction 2.1 Objectives 2.2 Matrices 2.3 Operation on Matrices 2.4 Invertible Matrices 2.5 Systems of Linear Equations 2.6 Answers to Check Your Progress

### Spring 2007 Math 510 Hints for practice problems

Spring 2007 Math 510 Hints for practice problems Section 1 Imagine a prison consisting of 4 cells arranged like the squares of an -chessboard There are doors between all adjacent cells A prisoner in one

### (67902) Topics in Theory and Complexity Nov 2, 2006. Lecture 7

(67902) Topics in Theory and Complexity Nov 2, 2006 Lecturer: Irit Dinur Lecture 7 Scribe: Rani Lekach 1 Lecture overview This Lecture consists of two parts In the first part we will refresh the definition

### Exponential time algorithms for graph coloring

Exponential time algorithms for graph coloring Uriel Feige Lecture notes, March 14, 2011 1 Introduction Let [n] denote the set {1,..., k}. A k-labeling of vertices of a graph G(V, E) is a function V [k].

### Continuity of the Perron Root

Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North

### Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

### Classification of Cartan matrices

Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### CONTRIBUTIONS TO ZERO SUM PROBLEMS

CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg

### Numerical Analysis Lecture Notes

Numerical Analysis Lecture Notes Peter J. Olver 5. Inner Products and Norms The norm of a vector is a measure of its size. Besides the familiar Euclidean norm based on the dot product, there are a number

### A Sublinear Bipartiteness Tester for Bounded Degree Graphs

A Sublinear Bipartiteness Tester for Bounded Degree Graphs Oded Goldreich Dana Ron February 5, 1998 Abstract We present a sublinear-time algorithm for testing whether a bounded degree graph is bipartite

### 8. Matchings and Factors

8. Matchings and Factors Consider the formation of an executive council by the parliament committee. Each committee needs to designate one of its members as an official representative to sit on the council,

### Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem. Senior Exercise in Mathematics. Jennifer Garbett Kenyon College

Lattice Point Geometry: Pick s Theorem and Minkowski s Theorem Senior Exercise in Mathematics Jennifer Garbett Kenyon College November 18, 010 Contents 1 Introduction 1 Primitive Lattice Triangles 5.1

### THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE. Alexander Barvinok

THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexer Barvinok Papers are available at http://www.math.lsa.umich.edu/ barvinok/papers.html This is a joint work with J.A. Hartigan

### 3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

### Linear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.

Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a sub-vector space of V[n,q]. If the subspace of V[n,q]

### The Characteristic Polynomial

Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem

### Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

### ON THE COMPLEXITY OF THE GAME OF SET. {kamalika,pbg,dratajcz,hoeteck}@cs.berkeley.edu

ON THE COMPLEXITY OF THE GAME OF SET KAMALIKA CHAUDHURI, BRIGHTEN GODFREY, DAVID RATAJCZAK, AND HOETECK WEE {kamalika,pbg,dratajcz,hoeteck}@cs.berkeley.edu ABSTRACT. Set R is a card game played with a

### Network (Tree) Topology Inference Based on Prüfer Sequence

Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,

### Cycles and clique-minors in expanders

Cycles and clique-minors in expanders Benny Sudakov UCLA and Princeton University Expanders Definition: The vertex boundary of a subset X of a graph G: X = { all vertices in G\X with at least one neighbor

### On the maximum average degree and the incidence chromatic number of a graph

Discrete Mathematics and Theoretical Computer Science DMTCS ol. 7, 2005, 203 216 On the maximum aerage degree and the incidence chromatic number of a graph Mohammad Hosseini Dolama 1 and Eric Sopena 2

### Computer Science Department. Technion - IIT, Haifa, Israel. Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

- 1 - THREE TREE-PATHS Avram Zehavi Alon Itai Computer Science Department Technion - IIT, Haifa, Israel Abstract Itai and Rodeh [IR] have proved that for any 2-connected graph G and any vertex s G there

### . 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9

Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a

### The tree-number and determinant expansions (Biggs 6-7)

The tree-number and determinant expansions (Biggs 6-7) André Schumacher March 20, 2006 Overview Biggs 6-7 [1] The tree-number κ(γ) κ(γ) and the Laplacian matrix The σ function Elementary (sub)graphs Coefficients

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### A characterization of trace zero symmetric nonnegative 5x5 matrices

A characterization of trace zero symmetric nonnegative 5x5 matrices Oren Spector June 1, 009 Abstract The problem of determining necessary and sufficient conditions for a set of real numbers to be the

### Cofactor Expansion: Cramer s Rule

Cofactor Expansion: Cramer s Rule MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Introduction Today we will focus on developing: an efficient method for calculating

### The Open University s repository of research publications and other research outputs

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:

### COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS

COUNTING INDEPENDENT SETS IN SOME CLASSES OF (ALMOST) REGULAR GRAPHS Alexander Burstein Department of Mathematics Howard University Washington, DC 259, USA aburstein@howard.edu Sergey Kitaev Mathematics

### The number of generalized balanced lines

The number of generalized balanced lines David Orden Pedro Ramos Gelasio Salazar Abstract Let S be a set of r red points and b = r + 2δ blue points in general position in the plane, with δ 0. A line l

### Solving Linear Systems, Continued and The Inverse of a Matrix

, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing

V. Adamchik 1 Graph Theory Victor Adamchik Fall of 2005 Plan 1. Basic Vocabulary 2. Regular graph 3. Connectivity 4. Representing Graphs Introduction A.Aho and J.Ulman acknowledge that Fundamentally, computer

### Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

### 160 CHAPTER 4. VECTOR SPACES

160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results