Add to ORKGLet 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 n - 1 order when n is odd. We also examine how other eigenvalues affect the size of matchings in G
AbstractIn this paper, we present an elementary proof of a theorem of Serre concerning the greatest ...
AbstractIn this paper, we show that if the second largest eigenvalue of a d-regular graph is less th...
AbstractA set of vertices S⊆V(G) is (k,τ)-regular if it induces a k-regular subgraph of G such that ...
AbstractLet G be a connected k-regular graph of order n. We find a best upper bound (in terms of k) ...
We study extremal and structural problems in regular graphs involving various parameters. In Chapter...
AbstractWe give sufficient conditions for existence of a perfect matching in a graph in terms of the...
We give sufficient conditions for existence of a perfect matching in a graph in terms of the eigenva...
AbstractHenning and Yeo proved a lower bound for the minimum size of a maximum matching in a connect...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
Abstract. In this paper we study tight lower bounds on the size of a maximum matching in a regular g...
In this paper, relevant results about the determination of (k,t)-regular sets, using the main eigenv...
Delsarte, Goethals, and Seidel (1977) used the linear programming method in order to find bounds for...
AbstractGraphs with (k,τ)-regular sets and equitable partitions are examples of graphs with regulari...
Graphs with (k, τ)-regular sets and equitable partitions are examples of graphs with regularity cons...
AbstractIn this paper, we present an elementary proof of a theorem of Serre concerning the greatest ...
AbstractIn this paper, we show that if the second largest eigenvalue of a d-regular graph is less th...
AbstractA set of vertices S⊆V(G) is (k,τ)-regular if it induces a k-regular subgraph of G such that ...
AbstractLet G be a connected k-regular graph of order n. We find a best upper bound (in terms of k) ...
We study extremal and structural problems in regular graphs involving various parameters. In Chapter...
AbstractWe give sufficient conditions for existence of a perfect matching in a graph in terms of the...
We give sufficient conditions for existence of a perfect matching in a graph in terms of the eigenva...
AbstractHenning and Yeo proved a lower bound for the minimum size of a maximum matching in a connect...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
Abstract. In this paper we study tight lower bounds on the size of a maximum matching in a regular g...
In this paper, relevant results about the determination of (k,t)-regular sets, using the main eigenv...
Delsarte, Goethals, and Seidel (1977) used the linear programming method in order to find bounds for...
AbstractGraphs with (k,τ)-regular sets and equitable partitions are examples of graphs with regulari...
Graphs with (k, τ)-regular sets and equitable partitions are examples of graphs with regularity cons...
AbstractIn this paper, we present an elementary proof of a theorem of Serre concerning the greatest ...
AbstractIn this paper, we show that if the second largest eigenvalue of a d-regular graph is less th...
AbstractA set of vertices S⊆V(G) is (k,τ)-regular if it induces a k-regular subgraph of G such that ...