Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...
where the sum runs from 0 to [n/2]. It is known that every matching polynomial has only real roots. See [1,2]. It would be interesting to find a vertex transitive graph whose matching polynomial has a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback