The matching polynomial of a polygraph
نویسندگان
چکیده
منابع مشابه
On "The Matching Polynomial of a Polygraph"
In this note we give an explanation for two phenomena mentioned in the concluding remarks of " The matching polynomial of a polygraph " by Babic et al. The following results are obtained: (1) Although three matrices for given polygraphs defined in the above article in general have different orders, they determine the same recurrence relations for the matching polynomial of these polygraphs. (2)...
متن کاملextensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولRelationship between Coefficients of Characteristic Polynomial and Matching Polynomial of Regular Graphs and its Applications
ABSTRACT. Suppose G is a graph, A(G) its adjacency matrix and f(G, x)=x^n+a_(n-1)x^(n-1)+... is the characteristic polynomial of G. The matching polynomial of G is defined as M(G, x) = x^n-m(G,1)x^(n-2) + ... where m(G,k) is the number of k-matchings in G. In this paper, we determine the relationship between 2k-th coefficient of characteristic polynomial, a_(2k), and k-th coefficient of matchin...
متن کاملPolynomial reconstruction of the matching polynomial
The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex-deleted subgraphs of the same graph. This note discusses the polynomial reconstructibility of the matching polynomial. We collect previous resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1986
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90014-4