Spectral results on regular graphs with (k, τ)-regular sets
|
|
- Britney Arnold
- 5 years ago
- Views:
Transcription
1 Discrete Mathematics 307 (007) Spectral results on regular graphs with (k, τ)-regular sets Domingos M. Cardoso, Paula Rama Dep. de Matemática, Univ. Aveiro, Aveiro, Portugal Received 5 October 00; received in revised form 15 January 004; accepted 18 November 005 Available online 7 November 006 Abstract A set of vertices S V (G) is (k, τ)-regular if it induces a k-regular subgraph of G such that N G (v) S =τ v / S. Note that a connected graph with more than one edge has a perfect matching if and only if its line graph has a (0, )-regular set. In this paper, some spectral results on the adjacency matrix of graphs with (k, τ)-regular sets are presented. Relations between the combinatorial structure of a p-regular graph with a (k, τ)-regular set and the eigenspace corresponding to each eigenvalue λ / {p, k τ} are deduced. Finally, additional results on the effects of Seidel switching (with respect to a bipartition induced by S) of regular graphs are also introduced. 006 Elsevier B.V. All rights reserved. Keywords: Adjacency matrix; Graph eigenvalues 1. Introduction In this paper we deal with undirected simple graphs, G = (V (G), E(G)), where V (G) denotes the nonempty set of vertices and E(G) the set of edges. It is assumed that G is of order n, i.e., V (G) =n. An element of E(G), which has the vertices i and j as endvertices, is denoted by ij.ifv V (G), then we denote the neighborhood of v by N G (v), that is, N G (v) ={w : vw E(G)}. The number of neighbors of v V (G) will be denoted by d G (v) and called, as usually, degree of v. IfG is such that v V (G) d G (v) = p then we say that G is p-regular. Given a subset of vertices S of a graph G, the vector x R V with x v = 1ifv S and x v = 0ifv/ S is called the characteristic vector of S. Throughout this paper, A G will denote the adjacency matrix of the graph G of order n>1, that is, A G = (a ij ) n n is such that { 1 if ij E(G) a ij = 0 otherwise, and λ min (A G ) will denote the minimum eigenvalue of A G. Note that A G is a symmetric matrix and then has n real eigenvalues. It is well known that if G has at least one edge then λ min (A G ) 1. Actually, λ min (A G ) = 0 if and only if G has no edges, λ min (A G ) = 1 if and only if G has at least one edge and each of its components is complete and otherwise λ min (A G ) [6]. Given a matrix A, σ(a) will denote the set of its eigenvalues. Throughout the text ê will denote the all-ones vector with n components. Supported by Centre for Research in Optimization and Control (CEOC) from the Fundação para a Ciência e a Tecnologia FCT, cofinanced by the European Community Fund FEDER. Corresponding author. addresses: dcardoso@mat.ua.pt (D.M. Cardoso), prama@mat.ua.pt (P. Rama) X/$ - see front matter 006 Elsevier B.V. All rights reserved. doi: /j.disc
2 . Basic properties of graphs with (k, τ)-regular sets and D.M. Cardoso, P. Rama / Discrete Mathematics 307 (007) According to [18] (see also [8]), a (ρ, γ)-set of a graph G is a subset of vertices S V (G) such that N G (v) S ρ if v S N G (v) S γ if v/ S, where ρ and γ are nonempty subsets of {0, 1,...,n}. Herein, when the subsets ρ and γ are singletons, ρ ={k} and γ ={τ}, we say that S is (k, τ)-regular, that is, S V (G) is (k, τ)-regular if and only if it is a ({k}, {τ})-set. Therefore, a (k, τ)-regular set S of a graph G is a subset of vertices which induces in G a k-regular subgraph such that every vertex out of S has τ neighbors in it. Therefore, if G has a (k, τ)-regular set S then in its complement, Ḡ, S is ( S k 1, S τ)- regular. From the above definition it is immediate that for all τ > 0a(0, τ)-regular set of a graph is a maximal stable set. Fig. 1 depicts a graph G where the set of vertices S ={1, 3, 4, 6} is (1, 4)-regular. As an application of (k, τ)-regular sets, note that according to [3] a connected graph has a perfect matching if and only if its line graph has a (0, )-regular set (related results can be found in [1,]). The following proposition is a generalization of a result introduced in [3]. Proposition 1. Let G be a graph with a (k 1, τ 1 )-regular set S 1 and a (k, τ )-regular set S. Then τ S 1 \S τ 1 S \S 1 = S 1 S (k 1 k ). (1) Proof. The number of edges xy with x S 1 and y S is τ 1 S \S 1 +k 1 S 1 S =τ S 1 \S +k S S 1 and then the proof follows. Note that if we consider k 1 = k or S 1 S = then (1) becomes τ S 1 \S =τ 1 S \S 1 and thus if τ = 0 then S 1 \S =(τ 1 /τ ) S \S 1. On the other hand, for τ 1 =τ =τ = 0, (1) becomes S 1 \S S \S 1 =(k 1 k )/τ S 1 S. Therefore we have the following corollary. Corollary 1. Let G be a graph with a (k 1, τ 1 )-regular set S 1 and a (k, τ )-regular set S, such that τ > 0. (a) If k 1 = k or S 1 S = then S 1 \S =(τ 1 /τ ) S \S 1. (b) If τ 1 = τ = τ then S 1 \S = S \S 1 +(k 1 k )/τ S 1 S. Fig. represents a graph with the (0, 1)-regular set S 1 ={, 5}, the (0, )-regular set S ={1, 3, 5} and the (1, )-regular set S 3 ={1, 3, 4, 6}. Then, according to Corollary 1 (part (a)), {} = S 1 \S = τ 1 S \S 1 = 1 {1, 3}, τ Fig. 1. Graph with the (1, 4)-regular set {1, 3, 4, 6}.
3 1308 D.M. Cardoso, P. Rama / Discrete Mathematics 307 (007) Fig.. Graph with the (0, 1)-regular set S 1 ={, 5}, the (0, )-regular set S ={1, 3, 5} and the (1, )-regular set S 3 ={1, 3, 4, 6}. and according to Corollary 1 (part (b)), {5} = S \S 3 = S 3 \S + k 1 k τ S S 3 = {4, 6} {1, 3}. Given a graph G, each (0, 1)-regular set L(IM) of the line graph L(G) defines an induced matching IM of G for which every edge of G belongs to the induced matching IM or has a common vertex with one and only one edge of IM. We designate such induced matching by perfect induced matching. Thus, if G has a perfect matching M E(G) and a perfect induced matching IM E(G) then, applying Corollary 1 (part (a)) on L(G), we may conclude that n/ = M M\IM = IM\M and hence IM\M n/4. 3. Eigenvalues and eigenspaces of graphs with (k, τ)-regular sets From now on, it is assumed that every (k, τ)-regular set is such that τ > 0 and the kernel (or null space) of a linear map, defined by a matrix A, is denoted by Ker(A). From [11] we have the following proposition, where (as assumed in the beginning of the paper) the graph has order n. [ Proposition ] (Neumaier [11]). IfGisap-regular graph with a (k, τ)-regular set S then k τ σ(a G ) and v = (p k)ê1 τê is an eigenvector corresponding to k τ, with ê 1 and ê being the all-ones vectors of dimension S and n S, respectively. It is obvious that the eigenvector v of Proposition is not orthogonal to the characteristic vector of the (k, τ)-regular set S. In the next proposition we conclude that for an eigenvalue λ σ(a G ), such that k τ = λ = p, its eigenspace is orthogonal to the characteristic vector of S. Proposition 3. Let G be a p-regular graph with a (k, τ)-regular set S. Then λ σ(a G ), such that k τ = λ = p, and v Ker(A G λi n ), v i = 0 and v i = 0. i S i/ S Proof. Let x be the characteristic vector of a (k, τ)-regular set S of G and let u be an eigenvector of λ σ(a G ), such that k τ = λ = p. Then A G u = λu which leads to x A G u = λ x u N G (i) S u i = λ u i i S i V (G) i S N G (i) S u i + i/ S N G (i) S u i = λ i S u i k i S u i + τ i/ S u i = λ i S u i (λ k) i S u i = τ(ê u i S u i ) (λ k + τ) i S u i = 0. As λ = k τ we have i S u i = 0 and, by regularity of G, ê u = 0, so we also have i/ S u i = 0.
4 D.M. Cardoso, P. Rama / Discrete Mathematics 307 (007) Fig. 3. A 4-regular graph G with (0, )-regular, (, 4)-regular and (, )-regular sets. Fig. 4. A 3-regular graph G with the (1, 1)-regular set {3, 6}. According to the above proposition we may conclude that when G is a p-regular graph, λ σ(a G ), such that k τ = λ = p, every eigenvector in Ker(A G λi n ) is orthogonal to the characteristic vector of any (k, τ)-regular set. Therefore, it provides information which could lead us to find (k, τ)-regular sets. Fig. 3 shows a 4-regular graph G, for which the spectrum is σ(a G )={[ ], [0] 3, [4] 1 }, 1 the corresponding columns of eigenvectors are and all (0, )-regular sets are maximum stable sets. Notice that from Proposition 3 and the fact that ê is an eigenvector of A G corresponding to the eigenvalue p (when G is p-regular) also follows the statement that k τ σ(a G ) and that its eigenspace is not orthogonal to the characteristic vector x of a (k, τ)-regular set, otherwise x would be orthogonal to all eigenvectors of A G but ê and thus x = μê, with μ = 0, which is a contradiction. As a direct consequence of Propositions and 3, considering that G is a p-regular graph with a (k, τ)-regular set S, we may conclude the following: k τ and p are the only eigenvalues with eigenspaces not orthogonal to the characteristic vector of S. If k = τ then 0 σ(a G ). If k τ then λ min (A G ) = k τ and thus the eigenspace of λ min (A G ) is orthogonal to the characteristic vector of the (k, τ)-regular set S. If G is strongly regular then its three distinct eigenvalues are integers (a similar conclusion was obtained in [11]). Fig. 4 represents a 3-regular graph with a (1, 1)-regular set S ={3, 6}, but with λ min (A G ) = = k τ. Note that from Proposition we may conclude that 0 σ(a G ) = {[ ], [0], [1] 1, [3] 1 } and the eigenspace corresponding to λ min (A G ) = is orthogonal to the characteristic vector of S. Fig. 5 illustrates the construction of an infinite. 1 Notice that [λ i ] m i means that the eigenvalue λ i has multiplicity m i. The eigenspace corresponding to is spanned by {( 1, 1, 1, 0, 0, 1), (1, 1, 1,,, 1)}
5 1310 D.M. Cardoso, P. Rama / Discrete Mathematics 307 (007) Fig. 5. Graphs (a) G with, 0, σ(a G ), (b) G 3 with 3, 1, 1, 3 σ(a G3 ) and (c) G 4 with 4,,, 4 σ(a G4 ). family of p-regular graphs of order p with (0,p)-regular and (p 1, 1)-regular sets. Considering the graphs of Fig. 5, the -regular graph G has the (0, )-regular set {, 3} and the (1, 1)-regular set {1, } (and then, 0, σ(a G )). The 3-regular graph G 3 has the (, 1)-regular set {1,, 3, 4} and the (0, 3)-regular set {, 3, 6, 7} (and then 3, 1, 1, 3 σ(a G3 )). The 4-regular graph G 4 has the (3, 1)-regular set {1,, 3, 4, 5, 6, 7, 8} and the (0, 4)-regular set {, 3, 6, 7, 10, 11, 14, 15} (and then 4,,, 4 σ(a G4 )). Proposition 4. Let G be a graph with two subsets of vertices S and S (S = S) such that S = S and both subsets induce k-regular subgraphs. Then λ min (A G ) S\ S k i S\ S N G(i) S. () S\ S Proof. Let x and x be the characteristic vectors of the two subsets of vertices S and S, respectively. Denoting the symmetric difference between S and S by S S, that is, S S = (S\ S) ( S\S), then as S and S have the same cardinality we may easily deduce that S S = S\ S = S\S. On the other hand, we know that and also { y } A G y λ min (A G ) = inf y : y = 0, (3) (x x) A G (x x) x x Furthermore, { k, i S, (A G x) i = N G (i) S, i / S = x A G x + x A G x x A G x. (4) S S and therefore x A G x = k S and x A G x = k S =k S. Finally, x A G x = k S S + N G (i) S =k S S + N G (i) S. i S\ S i S\S
6 D.M. Cardoso, P. Rama / Discrete Mathematics 307 (007) Proceeding with the development started in (4), (x x) A G (x x) x x = S k S S k i S\ S N G(i) S S\ S = S\ S k i S\ S N G(i) S. (5) S\ S Finally, from (3) and (5), λ min (A G ) S\ S k i S\ S N G(i) S. S\ S It was referred above that for a regular graph G with a (0, τ)-regular set, τ σ(a G ). In the next corollary, assuming the existence of a (0, τ)-regular set not equal to some stable set with the same cardinality, in the absence of regularity, we state that τ is still an upper bound for λ min (A G ). Corollary. Let G be a graph with two stable sets S and S (S = S) such that S = S and S is a (0, τ)-regular set. Then i S\ S λ min (A G ) N G(i) S = τ. S\ S Proof. Since S is a (0, τ)-regular set and S is another stable set of G such that S = S, then in () we have N G (v) S =τ, v S\ S and k = 0 which yields i S\ S λ min (A G ) N G(i) S = S\ S τ S\ S S\ S = τ. 4. Bipartitions with (k, τ)-regular sets and Seidel switching Given the graph G, a partition π=(v 1,...,V r ) of V (G) is such that its elements V j, for j =1,...,r, are nonempty, pairwise disjoint and r j=1 V j =V (G).A partition π=(v 1,...,V r ) of V (G) is equitable if for any pair i, j {1,...,r} and v V i the numbers m ij = N G (v) V j depend only on i and j, i.e, the number of neighbors which a vertex in V i has in V j is independent of the choice of the vertex in V i. For our purpose, we will consider equitable partitions of G with two subsets, π = (V 1,V ), which will be called equitable bipartitions. Equitable partitions were introduced in [13 15]. In the later one equitable bipartitions are used to obtain information about eigenvalues and eigenvectors of graphs. Equitable partitions appear related with automorphism groups of graphs [9], walk partitions and colorations [1], distance-regular graphs and covering graphs (see [7] for details and further references). Recent applications of equitable partitions may be found in [10] applied to the study of graphs with three eigenvalues and in [17] applied to the study of correlation structure of landscapes. A digraph D is a graph where the set of edges is replaced by a set of arcs, that is, a set of ordered pairs of vertices. If a digraph D has multiple arcs or loops then we say that D is a multi-digraph. The quotient graph G/π of G with respect to the equitable bipartition π is a multi-digraph with the subsets of π (V 1 and V ) as its vertices and with m ij arcs going from V i to V j. Thus G/π has, in general, both loops and multiple arcs. The adjacency matrix A G/π is the matrix with ij entries equal to m ij, [ ] m11 m A G/π = 1. m 1 m From the above definitions we may conclude that a bipartition of a graph H, π = (S, V (H )\S), is equitable if and only if S is (m 11,m 1 )-regular and V(H)\S is (m,m 1 )-regular.
7 131 D.M. Cardoso, P. Rama / Discrete Mathematics 307 (007) Fig. 6. Graphs G and G π with π = ({, 5}, {1, 3, 4, 6}). If G is[ a p-regular ] graph and S V (G) is (k, τ)-regular then π = (S, V (G)\S) is an equitable bipartition such that A G/π = k p k τ p τ. In particular, if S V (G) is a stable set such that N G (v) S =τ v / S, i.e., S is a (0, τ)-regular set, then G has an equitable bipartition π = (S, V (G)\S) with [ ] 0 p A G/π =. τ p τ Conversely, let G be a graph with an equitable bipartition π = (V 1,V ) such that V 1 is (k 1, τ 1 )-regular and V is (k, τ )-regular. Since d G (v 1 ) = k 1 + τ for v 1 V 1 and d G (v ) = k + τ 1 for v V then G is a regular graph if and only if k 1 k = τ 1 τ. Furthermore, from π = (V 1,V ) being a partition, we have that V 1 V =, V 1 + V =n and (1) turns into τ V 1 τ 1 V =0 τ (n V ) = τ 1 V V = nτ τ 1 + τ and hence V 1 =nτ 1 /(τ 1 + τ ). Next we will present the operation of the switching of edges which was introduced by Seidel [16]. Let us consider that each edge uv of a graph G corresponds to the set of arcs {(u, v), (v, u)}. Then, considering the bipartition π ={V 1,V } of the set of vertices of G, the graph obtained by switching in G with respect to the bipartition π, which will be denoted by G π, may be defined such that E(G π ) = E 11 ((V 1 V )\E 1 ) ((V V 1 )\E 1 ) E, and E ij = E(G) (V i V j ). The graph G π will be called the switching graph of G relative to the bipartition π. According to the above definition, it is obvious that π is an equitable bipartition of G if and only if π is an equitable bipartition of G π. Fig. 6 represents a pair of graphs which are the switching of each other with respect to an equitable bipartition. The following proposition includes a generalization of a result introduced in [3]. It must be noted that, as stated above (in the beginning of section 3), every (k, τ)-regular set considered here is such that τ > 0. Proposition 5. Let G be a p-regular graph with a (k, τ)-regular set S and π=(s, V (G)\S) the corresponding equitable bipartition. Then nτ S = (6) p k + τ and n p k + τ. (7) Furthermore, G π is a regular graph if and only if n = (p + S k τ), (8) and if p = k + τ, G π is a regular graph if and only if S =τ. (9) Proof. Proof of (6): If G is a p-regular graph and S is a (k, τ)-regular set of G then S (p k) = (n S )τ nτ = S (p k + τ) S = nτ p k + τ.
8 Proof of (7): From S τ > 0 and using (6) we get D.M. Cardoso, P. Rama / Discrete Mathematics 307 (007) n( S τ) = n S +nτ = n S + S (p k + τ) = S (p k + τ n) which yields (7), n p k + τ. Proof of (8): Consider graph G π and the adjacency matrix of G/π, [ ] k p k A G/π =. τ p τ For v S, N G π(v) S =k and N G π(v) (V (G)\S) =n S p + k, so d G π(v) = n S p + k. For v V (G)\S, N G π(v) S = S τ and N G π(v) (V (G)\S) =p τ, hence it follows that d G π(v) = S +p τ. Consequently, G π is regular if and only if n S p + k = S +p τ n = (p + S k τ). (10) Proof of (9): If G is regular and p = k + τ, then taking into account (6) and (8) it follows that S = (p + S k τ)τ p k + τ S (p k) + S τ = (p k τ)τ + S τ S (p k τ) = (p k τ)τ S =τ. Conversely, suppose that S =τ. Then, from (6) S (p k + τ) = nτ n = (p k + τ) n = (p k + S τ) and from (8) G π is regular. Theorem.4.9 of [4] states that if p is the degree of regularity of G π then p n/ σ(a G ). This statement can also be obtained from (10) taking into account that p = n S p + k = S +p τ, which leads to k = (p n + S +p)/ and τ = (p S p)/. Therefore, from k τ σ(a G ), it follows that p n/ = k τ is an eigenvalue of A G. From (8) we may conclude, as in [5, Corollary.4.10], that a graph with an odd number of vertices cannot be switched into a regular graph. Considering the graphs G and G π, by [5] σ(a G/π ) σ(a G ) and by [10] σ(a G π) = { σ(a G ) σ(a G π /π) } \σ(a G/π ), where the union and difference set operations are done taking into account the multiplicities of the eigenvalues. Then we may conclude that σ(a G π) = (σ(a G )\σ(a G/π )) σ(a G π /π). (11) For the next proposition we need some information about the spectra of G/π and G π /π in order to use (11). Lemma 1. LetGbeap-regular graph with a (k, τ)-regular set S and π = (S, V (G)\S) the corresponding equitable bipartition. Then σ(a G/π ) ={k τ,p} and p + k τ ± σ(a G π /π) = (p k + τ) + 4 S (n S p + k + τ) 4nτ.
9 1314 D.M. Cardoso, P. Rama / Discrete Mathematics 307 (007) Proof. The proof comes directly from the computation of the spectra of the matrices [ ] [ ] k p k k n S p + k A G/π = and A τ p τ G π /π =. S τ p τ The statement of Proposition that k τ σ(a G ) could be obtained applying Lemma 1 and the inclusion σ(a G/π ) σ(a G ) [5]. Proposition 6. LetGbeap-regular graph with a (k, τ)-regular set S and π = (S, V (G)\S) an equitable bipartition. Then λ min (A G π /π) k τ S n p + k n (p k + τ) (1) and if λ min (A G π /π)>k τ, p k + τ n<(p k + τ). (13) Furthermore, if λ min (A G π /π) k τ and λ min (A G ) = k τ then λ min (A G π) = λ min (A G π /π). Proof. Take into account Proposition, Lemma 1, (11) and the hypothesis σ(a G π) = ({..., k τ,...,p}\{k τ,p}) p + k τ ± (p k + τ) + 4 S (n S p + k + τ) 4nτ. (14) Let us prove (1). If λ min (A G π /π) k τ, then from Lemma 1, p + k τ (p k + τ) + 4 S (n S p + k + τ) 4nτ k τ, that is, (p k + τ) + 4 S (n S p + k + τ) 4nτ p k + τ (p k + τ) + 4 S (n S p + k + τ) 4nτ (p k + τ) S (n S p + k + τ) nτ, which by (6) is equivalent to S (n S p + k + τ) S (p k + τ) S n p + k. By (6) and the last inequality, nτ n p + k p k + τ nτ n(p k + τ) (p k)(p k + τ) n(p k) (p k)(p k + τ) 0 n (p k + τ). Let us prove (13). From the proof of (1), we have λ min (A G π /π)>k τ S >n p + k and n<(p k + τ). Then, from the last inequality and from (7), we conclude that p k + τ n<(p k + τ). Finally, if λ min (A G π /π) k τ and λ min (A G ) = k τ then, from (14), λ min (A G π) = λ min (A G π /π).
10 D.M. Cardoso, P. Rama / Discrete Mathematics 307 (007) Proposition 7. LetGbeap-regular graph with a (k, τ)-regular set S, such that p = k + τ and π = (S, V (G)\S) the corresponding equitable bipartition. If G π is a regular graph then (1) Sisa(k, τ)-regular set of G π. () σ(a G π) = σ(a G ). Proof. (1) If S is a (k, τ)-regular set of G then S is a (k, S τ)-regular set of G π. In addition, if G π is regular, then from Proposition 5, S =τ and hence S is a (k, τ)-regular set of G π. () From the regularity of G and k τ σ(a G ), it follows that σ(a G ) ={...,k τ,...,p}. On the other hand, from (11) and Lemma 1 we have σ(a G π) = (σ(a G )\σ(a G/π )) σ(a G π /π), σ(a G/π ) ={k τ,p}, p + k τ ± (p k + τ) + 4 S (n S p + k + τ) 4nτ σ(a G π /π) =. Taking into account the regularity of G π, then from Proposition 5, S =τ and n = (p + S k τ) = (p k + τ). Thus, accordingly, replacing S and n in σ(a G π /π) leads to σ(a G π /π) = = p + k τ ± p + k τ ± ={k τ,p}. (p k + τ) + 8τ(p k + τ) 8τ(p k + τ) (p k + τ) { } p + k τ ± (p k + τ) = Consequently, we conclude that σ(a G π) = σ(a G ). As an immediate consequence of this proposition, we may conclude that given a p-regular graph G, with a (k, τ)- regular set S such that p = k + τ and π = (S, V (G)\S) the corresponding equitable bipartition, if the switching graph G π is regular, then it is p-regular. It must be noted that combining the corollary of Lemma 6.6 in [4] (two regular connected graphs of the same degree are cospectral if and only if their ( 1, 1, 0)-adjacency matrices are cospectral) with Corollary 3.3 in [16] (switching equivalent graphs have the same ( 1, 1, 0)-adjacency eigenvalues), we may conclude that if a connected regular graph has a connected regular switching graph with the same degree, then they have the same spectrum. The difference between this conclusion and Proposition 7 (part ()) is that in the Proposition 7 we do not need to impose the connectivity on both graphs. On the other hand, the statement that both graphs have the same degree is a consequence of Proposition 7 (part ()). However, we need to impose that p = k + τ. For instance, using the notation of [4], we may apply Proposition 7 to the 11-regular graph G=(G 1 G 3 )+(G G 4 ), with the (3, 6)-regular set S = V(G 3 ) V(G 4 ), where G 1, G, G 3 and G 4 are the graphs depicted in Fig. 7. It must be noted that, as in [4], given the graphs H 1 and H, V(H 1 H ) = V(H 1 + H ) = V(H 1 ) V(H ), E(H 1 + H ) = E(H 1 ) E(H ) and E(H 1 H ) = E(H 1 ) E(H ) {ij : i V(H 1 ), j V(H )}. Consider the above referred graph G and the equitable bipartition π = (S, V (G)\S). Therefore, since 11 = p = k + τ = 9 and G π is regular, by Proposition 7, S is a (3, 6)-regular set of G π and σ(a G π) = σ(a G ). Note that the graph G is nonisomorphic to G π = (G 1 G 4 ) + (G G 3 ), σ(a G ) = σ(a G1 G 3 ) σ(a G G 4 ), with σ(a G1 G 3 ) = {[ 3] 1, [.4], [ ], [ 1], [0], [0.4], [1], [11] 1 } and σ(a G G 4 ) = {[ 3] 3, [ 1.6], [0] 6, [0.6], [11] 1 }, and σ(a G π) = σ(a G1 G 4 ) σ(a G G 3 ), with σ(a G1 G 4 ) = {[ 3], [.4], [ 1], [0] 4, [0.4], [1] 1, [11] 1 }and σ(a G G 3 ) = {[ 3], [ ], [ 1.6], [0] 4, [0.6], [1] 1, [11] 1 }.
11 1316 D.M. Cardoso, P. Rama / Discrete Mathematics 307 (007) Fig. 7. Two nonisomorphic 5-regular graphs (G 1 and G ) of order 8 and two nonisomorphic 3-regular graphs (G 3 and G 4 ) of order 6. Acknowledgments The authors wish to thank Professor Charles Delorme (Univ. Paris-Sud) and the referees for their valuable comments, corrections and suggestions. In particular, the original version of the proof of Proposition 1 was shortened and simplified by one of the referees. References [1] R. Barbosa, D.M. Cardoso, On regular-stable graphs, Ars Combin. 70 (004) [] D.M. Cardoso, Convex quadratic programming approach to the maximum matching problem, J. Global Optim. 1 (001) [3] D.M. Cardoso, P. Rama, Equitable bipartitions of graphs and related results, J. Math. Sci. 10 (004) [4] D. Cvetković, M. Doob, H. Sachs, Spectra of Graphs, Academic Press, New York, [5] D. Cvetković, P. Rowlinson, S. Simić, Eigenspaces of Graphs, Cambridge University Press, Cambridge, [6] M. Doob, A surprising property of the least eigenvalue of a graph, Linear Algebra Appl. 46 (198) 1 7. [7] C.D. Godsil, Algebraic Combinatorics, Chapman & Hall, New York, [8] M.M. Halldórsson, J. Kratochvíl, J.A. Telle, Independent sets with domination constraints, Discrete Appl. Math. 99 (000) [9] G. J. McKay, Backtrack programming and the graph isomorphism problem, M.Sc. Thesis, University of Melbourne, [10] M. Muzychuk, M. Klin, On graphs with three eigenvalues, Discrete Math. 189 (1998) [11] A. Neumaier, Regular sets and quasi-symmetric -designs, in: D. Jungnickel, K. Vedder (Eds.), Combinatorial Theory, Springer, Berlin, 198, pp [1] D.L. Powers, M.M. Sulaiman, The walk partition and colorations of a graph, Linear Algebra Appl. 48 (198) [13] H. Sachs, Über Teiler, Faktoren und Charakteristische Polynome von Graphen. Teil I, Wiss. Z. TH Ilmenau 1 (1966) 7 1. [14] H. Sachs, Über Teiler, Faktoren und Charakteristische Polynome von Graphen. Teil II, Wiss. Z. TH Ilmenau 13 (1967) [15] A.J. Schwenk, Computing the characteristic polynomial of a graph, in: R. Bari, F. Harary (Eds.), Graphs and Combinatorics, Springer, Berlin, 1974, pp [16] J.J. Seidel, A survey of two-graphs, in: Proceedings of the International Colloquium on Teorie Combinatorie, Rome 1973, Atti Convegni. Lincei, Atti Accad. Naz. Lincei, Rome, 17 (1976) [17] P.F. Stadler, G. Tinhofer, Equitable partitions, coherent algebras and random walks: applications to the correlation structure of landscapes, MATCH Commun. Math. Comput. Chem. 40 (1999) [18] J.A. Telle, Characterization of domination-type parameters in graphs, in: Proceedings of the 4th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Congr. Numer. 94 (1993) 9 16.
Maximum k-regular induced subgraphs
R u t c o r Research R e p o r t Maximum k-regular induced subgraphs Domingos M. Cardoso a Marcin Kamiński b Vadim Lozin c RRR 3 2006, March 2006 RUTCOR Rutgers Center for Operations Research Rutgers University
More informationThe Local Spectra of Regular Line Graphs
The Local Spectra of Regular Line Graphs M. A. Fiol a, M. Mitjana b, a Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya Barcelona, Spain b Departament de Matemàtica Aplicada I
More informationGraphs with convex-qp stability number
Universytet im. Adama Mickiewicza Poznań, January 2004 Graphs with convex-qp stability number Domingos M. Cardoso (Universidade de Aveiro) 1 Summary Introduction. The class of Q-graphs. Adverse graphs
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 informationOn the eigenvalues of Euclidean distance matrices
Volume 27, N. 3, pp. 237 250, 2008 Copyright 2008 SBMAC ISSN 00-8205 www.scielo.br/cam On the eigenvalues of Euclidean distance matrices A.Y. ALFAKIH Department of Mathematics and Statistics University
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 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 informationThe spectra of super line multigraphs
The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology
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 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 informationLAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS
Kragujevac Journal of Mathematics Volume 39() (015), Pages 193 05. LAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS HARISHCHANDRA S. RAMANE 1, GOURAMMA A. GUDODAGI 1,
More informationEQUIENERGETIC GRAPHS
5 Kragujevac J. Math. 26 (2004) 5 13. EQUIENERGETIC GRAPHS Harishchandra S. Ramane, 1 Hanumappa B. Walikar, 2 Siddani Bhaskara Rao, 3 B. Devadas Acharya, 4 Prabhakar R. Hampiholi, 1 Sudhir R. Jog, 1 Ivan
More informationThe minimum rank of matrices and the equivalence class graph
Linear Algebra and its Applications 427 (2007) 161 170 wwwelseviercom/locate/laa The minimum rank of matrices and the equivalence class graph Rosário Fernandes, Cecília Perdigão Departamento de Matemática,
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 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 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 informationEvery 4-connected line graph of a quasi claw-free graph is hamiltonian connected
Discrete Mathematics 308 (2008) 532 536 www.elsevier.com/locate/disc Note Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected Hong-Jian Lai a, Yehong Shao b, Mingquan Zhan
More informationON EQUIENERGETIC GRAPHS AND MOLECULAR GRAPHS
Kragujevac J. Sci. 29 2007) 73 84. UDC 541.66:547.318 ON EQUIENERGETIC GRAPHS AND MOLECULAR GRAPHS Hanumappa B. Walikar, a Harishchandra S. Ramane, b Ivan Gutman, c Sabeena B. Halkarni a a Department of
More informationCharacteristic polynomials of skew-adjacency matrices of oriented graphs
Characteristic polynomials of skew-adjacency matrices of oriented graphs Yaoping Hou Department of Mathematics Hunan Normal University Changsha, Hunan 410081, China yphou@hunnu.edu.cn Tiangang Lei Department
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationBipartite graphs with at most six non-zero eigenvalues
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 11 (016) 315 35 Bipartite graphs with at most six non-zero eigenvalues
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 informationCospectral graphs and the generalized adjacency matrix
Linear Algebra and its Applications 42 2007) 41 www.elsevier.com/locate/laa Cospectral graphs and the generalized adjacency matrix E.R. van Dam a,1, W.H. Haemers a,, J.H. Koolen b,2 a Tilburg University,
More informationTHE GRAPHS WHOSE PERMANENTAL POLYNOMIALS ARE SYMMETRIC
Discussiones Mathematicae Graph Theory 38 (2018) 233 243 doi:10.7151/dmgt.1986 THE GRAPHS WHOSE PERMANENTAL POLYNOMIALS ARE SYMMETRIC Wei Li Department of Applied Mathematics, School of Science Northwestern
More informationarxiv: v2 [math.co] 27 Jul 2013
Spectra of the subdivision-vertex and subdivision-edge coronae Pengli Lu and Yufang Miao School of Computer and Communication Lanzhou University of Technology Lanzhou, 730050, Gansu, P.R. China lupengli88@163.com,
More informationKeywords: compositions of integers, graphs, location problems, combinatorial optimization. 1. Introduction and motivation
MINIMUM WEIGHT t-composition OF AN INTEGER DOMINGOS M. CARDOSO (1) AND J. ORESTES CERDEIRA (2), (1) DEPARTAMENTO DE MATEMÁTICA, UNIV. DE AVEIRO, 3810-193 AVEIRO, PORTUGAL (DCARDOSO@MAT.UA.PT) (1) DEPARTAMENTO
More informationDiscrete Mathematics
Discrete Mathematics 310 (2010) 3398 303 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Maximal cliques in {P 2 P 3, C }-free graphs S.A.
More informationSEIDEL ENERGY OF ITERATED LINE GRAPHS OF REGULAR GRAPHS
Kragujevac Journal of Mathematics Volume 39(1) (015), Pages 7 1. SEIDEL ENERGY OF ITERATED LINE GRAPHS OF REGULAR GRAPHS HARISHCHANDRA S. RAMANE 1, IVAN GUTMAN, AND MAHADEVAPPA M. GUNDLOOR 3 Abstract.
More informationA Sharp Upper Bound on Algebraic Connectivity Using Domination Number
A Sharp Upper Bound on Algebraic Connectivity Using Domination Number M Aouchiche a, P Hansen a,b and D Stevanović c,d a GERAD and HEC Montreal, Montreal, Qc, CANADA b LIX, École Polytechnique, Palaiseau,
More informationHamiltonian problem on claw-free and almost distance-hereditary graphs
Discrete Mathematics 308 (2008) 6558 6563 www.elsevier.com/locate/disc Note Hamiltonian problem on claw-free and almost distance-hereditary graphs Jinfeng Feng, Yubao Guo Lehrstuhl C für Mathematik, RWTH
More informationNew feasibility conditions for directed strongly regular graphs
New feasibility conditions for directed strongly regular graphs Sylvia A. Hobart Jason Williford Department of Mathematics University of Wyoming Laramie, Wyoming, U.S.A sahobart@uwyo.edu, jwillif1@uwyo.edu
More informationEigenvalues and edge-connectivity of regular graphs
Eigenvalues and edge-connectivity of regular graphs Sebastian M. Cioabă University of Delaware Department of Mathematical Sciences Newark DE 19716, USA cioaba@math.udel.edu August 3, 009 Abstract In this
More informationA simplex like approach based on star sets for recognizing convex-qp adverse graphs
A simplex like approach based on star sets for recognizing convex-qp adverse graphs Domingos M. Cardoso Carlos J. Luz J. Comb. Optim., in press (the final publication is available at link.springer.com).
More informationDiscrete Mathematics. Kernels by monochromatic paths in digraphs with covering number 2
Discrete Mathematics 311 (2011) 1111 1118 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Kernels by monochromatic paths in digraphs with covering
More informationSpectra and Randić Spectra of Caterpillar Graphs and Applications to the Energy
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 77 07) 6-75 ISSN 0340-653 Spectra and Randić Spectra of Caterpillar Graphs and Applications to the Energy
More informationAN EXAMPLE OF USING STAR COMPLEMENTS IN CLASSIFYING STRONGLY REGULAR GRAPHS
Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.yu/filomat Filomat 22:2 (2008), 53 57 AN EXAMPLE OF USING STAR COMPLEMENTS IN CLASSIFYING STRONGLY REGULAR
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 informationTHIS paper is an extended version of the paper [1],
INTERNATIONAL JOURNAL OF MATHEMATICAL MODELS AND METHODS IN APPLIED SCIENCES Volume 8 04 Alternating Schur Series and Necessary Conditions for the Existence of Strongly Regular Graphs Vasco Moço Mano and
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 informationSpectral radii of graphs with given chromatic number
Applied Mathematics Letters 0 (007 158 16 wwwelseviercom/locate/aml Spectral radii of graphs with given chromatic number Lihua Feng, Qiao Li, Xiao-Dong Zhang Department of Mathematics, Shanghai Jiao Tong
More informationA linear algebraic view of partition regular matrices
A linear algebraic view of partition regular matrices Leslie Hogben Jillian McLeod June 7, 3 4 5 6 7 8 9 Abstract Rado showed that a rational matrix is partition regular over N if and only if it satisfies
More informationOn zero-sum partitions and anti-magic trees
Discrete Mathematics 09 (009) 010 014 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc On zero-sum partitions and anti-magic trees Gil Kaplan,
More informationThe spectrum of the edge corona of two graphs
Electronic Journal of Linear Algebra Volume Volume (1) Article 4 1 The spectrum of the edge corona of two graphs Yaoping Hou yphou@hunnu.edu.cn Wai-Chee Shiu Follow this and additional works at: http://repository.uwyo.edu/ela
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 informationDiscrete Mathematics. The edge spectrum of the saturation number for small paths
Discrete Mathematics 31 (01) 68 689 Contents lists available at SciVerse ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc The edge spectrum of the saturation number for
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 informationTheorems of Erdős-Ko-Rado type in polar spaces
Theorems of Erdős-Ko-Rado type in polar spaces Valentina Pepe, Leo Storme, Frédéric Vanhove Department of Mathematics, Ghent University, Krijgslaan 28-S22, 9000 Ghent, Belgium Abstract We consider Erdős-Ko-Rado
More informationConnectivity of graphs with given girth pair
Discrete Mathematics 307 (2007) 155 162 www.elsevier.com/locate/disc Connectivity of graphs with given girth pair C. Balbuena a, M. Cera b, A. Diánez b, P. García-Vázquez b, X. Marcote a a Departament
More informationBulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26
Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts - 001 Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 6 SOME SPECTRAL PROPERTIES OF STARLIKE TREES M. LEPOVIĆ, I.
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 informationBicyclic digraphs with extremal skew energy
Electronic Journal of Linear Algebra Volume 3 Volume 3 (01) Article 01 Bicyclic digraphs with extremal skew energy Xiaoling Shen Yoaping Hou yphou@hunnu.edu.cn Chongyan Zhang Follow this and additional
More informationTactical Decompositions of Steiner Systems and Orbits of Projective Groups
Journal of Algebraic Combinatorics 12 (2000), 123 130 c 2000 Kluwer Academic Publishers. Manufactured in The Netherlands. Tactical Decompositions of Steiner Systems and Orbits of Projective Groups KELDON
More informationOn the spectral radii of quasi-tree graphs and quasiunicyclic graphs with k pendent vertices
Electronic Journal of Linear Algebra Volume 20 Volume 20 (2010) Article 30 2010 On the spectral radii of quasi-tree graphs and quasiunicyclic graphs with k pendent vertices Xianya Geng Shuchao Li lscmath@mail.ccnu.edu.cn
More informationAverage Mixing Matrix of Trees
Electronic Journal of Linear Algebra Volume 34 Volume 34 08 Article 9 08 Average Mixing Matrix of Trees Chris Godsil University of Waterloo, cgodsil@uwaterloo.ca Krystal Guo Université libre de Bruxelles,
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 432 2010 661 669 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa On the characteristic and
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 informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
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 informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H 1, H 2 ) so that H 1 H 2 = G E(H 1 ) E(H 2 ) = V (H 1 ) V (H 2 ) = k Such a separation is proper if V (H
More informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationThe spectral radius of graphs on surfaces
The spectral radius of graphs on surfaces M. N. Ellingham* Department of Mathematics, 1326 Stevenson Center Vanderbilt University, Nashville, TN 37240, U.S.A. mne@math.vanderbilt.edu Xiaoya Zha* Department
More informationOrdering trees by their largest eigenvalues
Linear Algebra and its Applications 370 (003) 75 84 www.elsevier.com/locate/laa Ordering trees by their largest eigenvalues An Chang a,, Qiongxiang Huang b a Department of Mathematics, Fuzhou University,
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 informationNear-domination in graphs
Near-domination in graphs Bruce Reed Researcher, Projet COATI, INRIA and Laboratoire I3S, CNRS France, and Visiting Researcher, IMPA, Brazil Alex Scott Mathematical Institute, University of Oxford, Oxford
More informationRegular graphs with a small number of distinct eigenvalues
Regular graphs with a small number of distinct eigenvalues Tamara Koledin UNIVERZITET U BEOGRADU ELEKTROTEHNIČKI FAKULTET This is joint work with Zoran Stanić Bipartite regular graphs Bipartite regular
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 informationOn spectral radius and energy of complete multipartite graphs
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn., ISSN 1855-3974 (electronic edn. ARS MATHEMATICA CONTEMPORANEA 9 (2015 109 113 On spectral radius and energy of complete multipartite
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 435 (2011) 1029 1033 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Subgraphs and the Laplacian
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
More informationWhen can the components of NEPS of connected bipartite graphs be almost cospectral?
When can the components of NEPS of connected bipartite graphs be almost cospectral? Dragan Stevanović Department of Mathematics, Faculty of Science, Ćirila i Metodija 2, Niš 18000, Yugoslavia dragance@pmf.pmf.ni.ac.yu
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 informationDiscrete Applied Mathematics
Discrete Applied Mathematics 159 (2011) 1345 1351 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam On disconnected cuts and separators
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 informationarxiv: v1 [math.co] 28 Oct 2016
More on foxes arxiv:1610.09093v1 [math.co] 8 Oct 016 Matthias Kriesell Abstract Jens M. Schmidt An edge in a k-connected graph G is called k-contractible if the graph G/e obtained from G by contracting
More informationORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS
ORBITAL DIGRAPHS OF INFINITE PRIMITIVE PERMUTATION GROUPS SIMON M. SMITH Abstract. If G is a group acting on a set Ω and α, β Ω, the digraph whose vertex set is Ω and whose arc set is the orbit (α, β)
More informationOn the spectral radius of graphs with cut edges
Linear Algebra and its Applications 389 (2004) 139 145 www.elsevier.com/locate/laa On the spectral radius of graphs with cut edges Huiqing Liu a,meilu b,, Feng Tian a a Institute of Systems Science, Academy
More informationGraphs and Combinatorics
Graphs and Combinatorics (2005) 21:469 474 Digital Object Identifier (DOI) 10.1007/s00373-005-0625-0 Graphs and Combinatorics Springer-Verlag 2005 On Group Chromatic Number of Graphs Hong-Jian Lai 1 and
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 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 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 information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
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 informationAALBORG UNIVERSITY. Directed strongly regular graphs with rank 5. Leif Kjær Jørgensen. Department of Mathematical Sciences. Aalborg University
AALBORG UNIVERSITY Directed strongly regular graphs with ran 5 by Leif Kjær Jørgensen R-2014-05 May 2014 Department of Mathematical Sciences Aalborg University Fredri Bajers Vej G DK - 9220 Aalborg Øst
More informationDiscrete Mathematics
Discrete Mathematics 3 (0) 333 343 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc The Randić index and the diameter of graphs Yiting Yang a,
More informationOn graphs with largest Laplacian eigenvalue at most 4
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 44 (2009), Pages 163 170 On graphs with largest Laplacian eigenvalue at most 4 G. R. Omidi Department of Mathematical Sciences Isfahan University of Technology
More informationUNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS
UNAVOIDABLE INDUCED SUBGRAPHS IN LARGE GRAPHS WITH NO HOMOGENEOUS SETS MARIA CHUDNOVSKY, RINGI KIM, SANG-IL OUM, AND PAUL SEYMOUR Abstract. An n-vertex graph is prime if it has no homogeneous set, that
More informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
More informationarxiv: v1 [cs.ds] 11 Oct 2018
Path matrix and path energy of graphs arxiv:1810.04870v1 [cs.ds] 11 Oct 018 Aleksandar Ilić Facebook Inc, Menlo Park, California, USA e-mail: aleksandari@gmail.com Milan Bašić Faculty of Sciences and Mathematics,
More informationPERFECT COLOURINGS OF REGULAR GRAPHS
PERFECT COLOURINGS OF REGULAR GRAPHS JOSEPH RAY CLARENCE DAMASCO AND DIRK FRETTLÖH Abstract. A vertex colouring of some graph is called perfect if each vertex of colour i has exactly a ij neighbours of
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 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 informationTopics in Graph Theory
Topics in Graph Theory September 4, 2018 1 Preliminaries A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End
More informationObservation 4.1 G has a proper separation of order 0 if and only if G is disconnected.
4 Connectivity 2-connectivity Separation: A separation of G of order k is a pair of subgraphs (H, K) with H K = G and E(H K) = and V (H) V (K) = k. Such a separation is proper if V (H) \ V (K) and V (K)
More informationLongest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs
Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs Gregory Gutin Department of Mathematical Sciences Brunel, The University of West London Uxbridge, Middlesex,
More informationAUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS
AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize
More informationConstructive proof of deficiency theorem of (g, f)-factor
SCIENCE CHINA Mathematics. ARTICLES. doi: 10.1007/s11425-010-0079-6 Constructive proof of deficiency theorem of (g, f)-factor LU HongLiang 1, & YU QingLin 2 1 Center for Combinatorics, LPMC, Nankai University,
More informationEdge-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 informationNormalized Laplacian spectrum of two new types of join graphs
Journal of Linear and Topological Algebra Vol. 6, No. 1, 217, 1-9 Normalized Laplacian spectrum of two new types of join graphs M. Hakimi-Nezhaad a, M. Ghorbani a a Department of Mathematics, Faculty of
More informationCospectral bipartite graphs for the normalized Laplacian. Steven Paul Osborne. A dissertation submitted to the graduate faculty
Cospectral bipartite graphs for the normalized Laplacian by Steven Paul Osborne A dissertation submitted to the graduate faculty in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY
More informationv iv j E(G) x u, for each v V(G).
Volume 3, pp. 514-5, May 01 A NOTE ON THE LEAST EIGENVALUE OF A GRAPH WITH GIVEN MAXIMUM DEGREE BAO-XUAN ZHU Abstract. This note investigates the least eigenvalues of connected graphs with n vertices and
More information