DOIAbstract
AbstractWe give sufficient conditions for existence of a perfect matching in a graph in terms of the eigenvalues of the Laplacian matrix. We also show that a distance-regular graph of degree k is k-edge-connected
AbstractWe give sufficient conditions for existence of a perfect matching in a graph in terms of the eigenvalues of the Laplacian matrix. We also show that a distance-regular graph of degree k is k-edge-connected
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
AbstractHenning and Yeo proved a lower bound for the minimum size of a maximum matching in a connect...
AbstractA graph G satisfies the neighborhood condition ANC(G) ⩾ m if, for all pairs of vertices of G...
AMS classification: 05C50, 05C70, 05E30.graph;perfect matching;Laplacian matrix;eigenvalues.
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...
AbstractLet G be a connected k-regular graph of order n. We find a best upper bound (in terms of k) ...
AbstractA tree is said to have a perfect matching if it has a spanning forest whose components are p...
Let G be a connected k-regular graph of order n. We find a best upper bound (in terms of k) on the t...
AbstractLet G be a graph, its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractThis paper considers an algorithm for finding a perfect matching, if there is one, in a bipa...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
A tree is said to have a perfect matching if it has a spanning forest whose components are paths on ...
AbstractTutte's theorem on perfect matchings is considered from the viewpoint of the Marriage Proble...
We study extremal and structural problems in regular graphs involving various parameters. In Chapter...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
AbstractHenning and Yeo proved a lower bound for the minimum size of a maximum matching in a connect...
AbstractA graph G satisfies the neighborhood condition ANC(G) ⩾ m if, for all pairs of vertices of G...
AMS classification: 05C50, 05C70, 05E30.graph;perfect matching;Laplacian matrix;eigenvalues.
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...
AbstractLet G be a connected k-regular graph of order n. We find a best upper bound (in terms of k) ...
AbstractA tree is said to have a perfect matching if it has a spanning forest whose components are p...
Let G be a connected k-regular graph of order n. We find a best upper bound (in terms of k) on the t...
AbstractLet G be a graph, its Laplacian matrix is the difference of the diagonal matrix of its verte...
AbstractThis paper considers an algorithm for finding a perfect matching, if there is one, in a bipa...
AbstractAll connected graphs with exactly one or two Laplacian eigenvalues greater than two are dete...
A tree is said to have a perfect matching if it has a spanning forest whose components are paths on ...
AbstractTutte's theorem on perfect matchings is considered from the viewpoint of the Marriage Proble...
We study extremal and structural problems in regular graphs involving various parameters. In Chapter...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
AbstractHenning and Yeo proved a lower bound for the minimum size of a maximum matching in a connect...
AbstractA graph G satisfies the neighborhood condition ANC(G) ⩾ m if, for all pairs of vertices of G...
Add to ORKG