AbstractLet 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
AbstractFor a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) θ1 ...
Let G be a simple graph with least eigenvalue λ and let S be a set of vertices in G which ind...
AbstractGraphs with (k,τ)-regular sets and equitable partitions are examples of graphs with regulari...
AbstractLet G be a connected k-regular graph of order n. We find a best upper bound (in terms of k) ...
Let G be a connected k-regular graph of order n. We find a best upper bound (in terms of k) on the t...
AbstractWe find lower bounds on the difference between the spectral radius λ1 and the average degree...
We study extremal and structural problems in regular graphs involving various parameters. In Chapter...
In this paper, relevant results about the determination of (k,t)-regular sets, using the main eigenv...
Abstract. In this paper we study tight lower bounds on the size of a maximum matching in a regular g...
AbstractWe give sufficient conditions for existence of a perfect matching in a graph in terms of the...
AbstractHenning and Yeo proved a lower bound for the minimum size of a maximum matching in a connect...
AbstractVery little is known about upper bound for the largest eigenvalue of a tree with a given siz...
AMS classification: 05C50, 05C70, 05E30.graph;perfect matching;Laplacian matrix;eigenvalues.
AbstractIn this paper, we show that if the second largest eigenvalue of a d-regular graph is less th...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
AbstractFor a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) θ1 ...
Let G be a simple graph with least eigenvalue λ and let S be a set of vertices in G which ind...
AbstractGraphs with (k,τ)-regular sets and equitable partitions are examples of graphs with regulari...
AbstractLet G be a connected k-regular graph of order n. We find a best upper bound (in terms of k) ...
Let G be a connected k-regular graph of order n. We find a best upper bound (in terms of k) on the t...
AbstractWe find lower bounds on the difference between the spectral radius λ1 and the average degree...
We study extremal and structural problems in regular graphs involving various parameters. In Chapter...
In this paper, relevant results about the determination of (k,t)-regular sets, using the main eigenv...
Abstract. In this paper we study tight lower bounds on the size of a maximum matching in a regular g...
AbstractWe give sufficient conditions for existence of a perfect matching in a graph in terms of the...
AbstractHenning and Yeo proved a lower bound for the minimum size of a maximum matching in a connect...
AbstractVery little is known about upper bound for the largest eigenvalue of a tree with a given siz...
AMS classification: 05C50, 05C70, 05E30.graph;perfect matching;Laplacian matrix;eigenvalues.
AbstractIn this paper, we show that if the second largest eigenvalue of a d-regular graph is less th...
The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of it...
AbstractFor a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) θ1 ...
Let G be a simple graph with least eigenvalue λ and let S be a set of vertices in G which ind...
AbstractGraphs with (k,τ)-regular sets and equitable partitions are examples of graphs with regulari...
DOI
Add to ORKG