a r t i c l e i n f o a b s t r a c t Let G be a connected k-regular graph of order n. We find a best upper bound (in terms of k) on the third largest eigenvalue that is sufficient to guarantee that G has a perfect matching when n is even, and a matching of order n − 1 when n is odd. We also examine how other eigenvalues affect the size of matchings in G.
Let G be an irregular graph on n vertices with maximum degree ∆ and diameter D. We show that ∆ − λ 1 > 1 nD , where λ 1 is the largest eigenvalue of the adjacency matrix of G. We also study the effect of adding or removing few edges on the spectral radius of a regular graph. Our graph notation is standard (see West ). For a graph G, we denote by λ i (G)… (More)
We study the minimum number of complete r-partite r-uniform hypergraphs needed to partition the edges of the complete r-uniform hypergraph on n vertices and we improve previous results of Alon.
Let λ 1 be the greatest eigenvalue and λ n the least eigenvalue of the adjacency matrix of a connected graph G with n vertices, m edges and diameter D. We prove that if G is nonregular, then Δ − λ 1 > nΔ − 2m n(D(nΔ − 2m) + 1) 1 n(D + 1) , where Δ is the maximum degree of G. The inequality improves previous bounds of Stevanovi´c and of Zhang. It also… (More)
a r t i c l e i n f o a b s t r a c t Keywords: Eigenvalues of graphs Graph spectrum Expander Edge-transitive graphs Vertex-transitive graphs Extremal graph theory Algebraically defined graphs Let q = p e , where p is a prime and e 1 is an integer. For m 1, let P and L be two copies of the (m + 1)-dimensional vector spaces over the finite field F q.… (More)
In this note, we study the degree distance of a graph which is a degree analogue of the Wiener index. Given n and e, we determine the minimum degree distance of a connected graph of order n and size e.
In this paper, we present an elementary proof of a theorem of Serre concerning the greatest eigenvalues of k-regular graphs. We also prove an analogue of Serre's theorem regarding the least eigenvalues of k-regular graphs: given ǫ > 0, there exist a positive constant c = c(ǫ, k) and a nonnegative integer g = g(ǫ, k) such that for any k-regular graph X with… (More)
In 1891, Petersen proved that every cubic graph without cut-edges has a perfect matching. In 1891, Petersen proved that every cubic graph without cut-edges has a perfect matching. If there are cut-edges in a cubic graph, then what happens? In 1891, Petersen proved that every cubic graph without cut-edges has a perfect matching. If there are cut-edges in a… (More)
For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k.
The chromatic number χ(G) of a graph G is the minimum number of colors in a proper coloring of the vertices of G. The biclique partition number bp(G) is the minimum number of complete bipartite subgraphs whose edges partition the edge-set of G. The Rank-Coloring Conjecture (formulated by van Nuffelen in 1976) states that χ(G) ≤ rank(A(G)), where rank(A(G))… (More)