Add to ORKG[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;不具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=Drexel&SrcApp=hagerty_opac&KeyRecord=0166-218X&DestApp=JCR&RQ=IF_CAT_BOXPLO
Abstract. A distance-regular graph of diameter d has 2d intersection numbers that de-terminemany pro...
The matching polynomial of a graph is the generating function of the numbers of its matchings with r...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
AbstractA matching of a graph G is a spanning subgraph of G in which every component is either a nod...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
AbstractExplicit formulae are derived for the first four coefficients of the matching polynomial of ...
AbstractLet G be an arbitrary simple graph. Godsil and Gutman in 1978 and Yan et al. in 2005 establi...
Heilmann et Lieb ont introduit le polynôme de couplage µ(G,x) d’un graphe G=(V,E). Nous prolongeons...
Abstract. A distance-regular graph of diameter d has 2d intersection numbers that de-terminemany pro...
Abstract. A distance-regular graph of diameter d has 2d intersection numbers that de-terminemany pro...
The matching polynomial of a graph is the generating function of the numbers of its matchings with r...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...
AbstractA matching of a graph G is a spanning subgraph of G in which every component is either a nod...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
AbstractExplicit formulae are derived for the first four coefficients of the matching polynomial of ...
AbstractLet G be an arbitrary simple graph. Godsil and Gutman in 1978 and Yan et al. in 2005 establi...
Heilmann et Lieb ont introduit le polynôme de couplage µ(G,x) d’un graphe G=(V,E). Nous prolongeons...
Abstract. A distance-regular graph of diameter d has 2d intersection numbers that de-terminemany pro...
Abstract. A distance-regular graph of diameter d has 2d intersection numbers that de-terminemany pro...
The matching polynomial of a graph is the generating function of the numbers of its matchings with r...
[[sponsorship]]數學研究所[[note]]已出版;[SCI];有審查制度;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gate...