Elementary proof of the reality of the zeros of beta-polynomials of complete graphs
Xueliang Li, Ivan Gutman (2000)
Kragujevac Journal of Mathematics
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “The -polynomials of complete graphs are real.”
Elementary proof of the reality of the zeros of beta-polynomials of complete graphs
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:
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:
Broken-cycle-free subgraphs and the log-concavity conjecture for chromatic polynomials.
Lundow, P.H., Markström, K. (2006)
Experimental Mathematics
Similarity:
Certificates of factorisation for chromatic polynomials.
Morgan, Kerri, Farr, Graham (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Single polynomials that correspond to pairs of cyclotomic polynomials with interlacing zeros
James McKee, Chris Smyth (2013)
Open Mathematics
Similarity:
We give a complete classification of all pairs of cyclotomic polynomials whose zeros interlace on the unit circle, making explicit a result essentially contained in work of Beukers and Heckman. We show that each such pair corresponds to a single polynomial from a certain special class of integer polynomials, the 2-reciprocal discbionic polynomials. We also show that each such pair also corresponds (in four different ways) to a single Pisot polynomial from a certain restricted class,...
A study about the Tutte polynomials of benzenoid chains
Abdulgani Sahin (2017)
Topological Algebra and its Applications
Similarity:
The Tutte polynomials for signed graphs were introduced by Kauffman. In 2012, Fath-Tabar, Gholam-Rezaeı and Ashrafı presented a formula for computing Tutte polynomial of a benzenoid chain. From this point on, we have also calculated the Tutte polynomials of signed graphs of benzenoid chains in this study.
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 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: