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:
Displaying similar documents to “Zeros of the Jones polynomial are dense in the complex plane.”
The -polynomials of complete graphs are real.
A multivariate interlace polynomial and its computation for graphs of bounded clique-width.
Courcelle, Bruno (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On some graphic polynomials whose zeros are real.
Gutman, Ivan (1985)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Contribution to the problem of the spectra of compound graphs.
I. Gutman (1978)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Homomorphism and sigma polynomials.
Gillman, Richard Alan (1995)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Elementary proof of the reality of the zeros of beta-polynomials of complete graphs
Xueliang Li, Ivan Gutman (2000)
Kragujevac Journal of Mathematics
Similarity:
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:
The higher-order matching polynomial of a graph.
Araujo, Oswaldo, Estrada, Mario, Morales, Daniel A., Rada, Juan (2005)
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:
Quantum field theory over .
Schnetz, Oliver (2011)
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:
Kocay's lemma, Whitney's theorem, and some polynomial invariant reconstruction problems.
Thatte, Bhalchandra D. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Broken-cycle-free subgraphs and the log-concavity conjecture for chromatic polynomials.
Lundow, P.H., Markström, K. (2006)
Experimental Mathematics
Similarity: