AbstractLet G be an arbitrary simple graph. Godsil and Gutman in 1978 and Yan et al. in 2005 established different expressions for the matching polynomial μ(G,x) in terms of det(xIn−H) for some families of matrices H. This paper improves their results and simplifies the computation of μ(G,x)
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
The matching polynomial of a graph is the generating function of the numbers of its matchings with r...
Given a graph G with n vertices, let p(G, j) denote the number of ways j mutually non-incident edges...
AbstractA matching of a graph G is a spanning subgraph of G in which every component is either a nod...
The concept of the matching polynomial of a graph, introduced by Farrell in 1979, has received consi...
We discuss the connection between determinants of modified matching matrices and the matching polyno...
AbstractExplicit formulae are derived for the first four coefficients of the matching polynomial of ...
In this note we give an explanation for two phenomena mentioned in the concluding remarks of “The ma...
A new algorithm is described for the calculation of characteristic polynomials of graphs. This algor...
The concept of the matching polynomial of a graph, introduced by Farrell in 1979, has received consi...
The concept of the matching polynomial of a graph, introduced by Farrell in 1979, has received consi...
AbstractIn this note we give an explanation for two phenomena mentioned in the concluding remarks of...
AbstractA matching of a graph G is a spanning subgraph of G in which every component is either a nod...
Let G be a simple graph on n vertices. An r-matching in G is a set of r independent edges. The numbe...
Given a graph G with n vertices, let p(G, j) denote the number of ways j mutually non-incident edges...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
The matching polynomial of a graph is the generating function of the numbers of its matchings with r...
Given a graph G with n vertices, let p(G, j) denote the number of ways j mutually non-incident edges...
AbstractA matching of a graph G is a spanning subgraph of G in which every component is either a nod...
The concept of the matching polynomial of a graph, introduced by Farrell in 1979, has received consi...
We discuss the connection between determinants of modified matching matrices and the matching polyno...
AbstractExplicit formulae are derived for the first four coefficients of the matching polynomial of ...
In this note we give an explanation for two phenomena mentioned in the concluding remarks of “The ma...
A new algorithm is described for the calculation of characteristic polynomials of graphs. This algor...
The concept of the matching polynomial of a graph, introduced by Farrell in 1979, has received consi...
The concept of the matching polynomial of a graph, introduced by Farrell in 1979, has received consi...
AbstractIn this note we give an explanation for two phenomena mentioned in the concluding remarks of...
AbstractA matching of a graph G is a spanning subgraph of G in which every component is either a nod...
Let G be a simple graph on n vertices. An r-matching in G is a set of r independent edges. The numbe...
Given a graph G with n vertices, let p(G, j) denote the number of ways j mutually non-incident edges...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
The matching polynomial of a graph is the generating function of the numbers of its matchings with r...
Given a graph G with n vertices, let p(G, j) denote the number of ways j mutually non-incident edges...
DOI
Add to ORKG