Homomorphism and sigma polynomials.
Gillman, Richard Alan (1995)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Displaying similar documents to “The higher-order matching polynomial of a graph.”
Homomorphism and sigma polynomials.
On a class of polynomials associated with the cliques in a graph and its applications.
Farrell, E.J. (1989)
International Journal of Mathematics and Mathematical Sciences
Similarity:
A multivariate interlace polynomial and its computation for graphs of bounded clique-width.
Courcelle, Bruno (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A generalization of the dichromatic polynomial of a graph.
Farrell, E.J. (1981)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The Wiener polynomial of the th power graph.
Abughneim, Omar A., Al-Ezeh, Hasan, Al-Ezeh, Mahmoud (2007)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements.
Hagos, Elias M. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The matching polynomial of a distance-regular graph.
Beezer, Robert A., Farrell, E.J. (2000)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Contribution to the problem of the spectra of compound graphs.
I. Gutman (1978)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
The -polynomials of complete graphs are real.
Li, Xueliang, Gutman, Ivan, Milovanović, V.Gradimir (2000)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Chromatic roots of a ring of four cliques.
Dong, F.M., Royle, Gordon, Wagner, Dave (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zeros of the Jones polynomial are dense in the complex plane.
Jin, Xian'an, Zhang, Fuji, Dong, Fengming, Tay, Eng Guan (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bipartition Polynomials, the Ising Model, and Domination in Graphs
Markus Dod, Tomer Kotek, James Preen, Peter Tittmann (2015)
Discussiones Mathematicae Graph Theory
Similarity:
This paper introduces a trivariate graph polynomial that is a common generalization of the domination polynomial, the Ising polynomial, the matching polynomial, and the cut polynomial of a graph. This new graph polynomial, called the bipartition polynomial, permits a variety of interesting representations, for instance as a sum ranging over all spanning forests. As a consequence, the bipartition polynomial is a powerful tool for proving properties of other graph polynomials and graph...
Quantum field theory over .
Schnetz, Oliver (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: