On the minimum roots of the adjoint polynomials of unicyclic graphs

zbMATH Open1299.05179MaRDI QIDQ4980959FDOQ4980959

Authors: Haizhen Ren, Yanling Gao 

Publication date: 30 June 2014

Recommendations

• The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than \(-4\)
• On the minimum real roots of the adjoint polynomial of a graph
• scientific article; zbMATH DE number 5631132
• On extremes of minimum real roots of adjoint polynomials of graphs with \(R(G)\geq -1\)
• scientific article; zbMATH DE number 2108155

zbMATH Keywords

chromatic polynomialunicyclic graphsadjoint polynomialminimum roots

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Cited In (5)

• The roots of the adjoint polynomials of a class of graphs
• On extremes of minimum real roots of adjoint polynomials of graphs with \(R(G)\geq -1\)
• On the minimum real roots of the adjoint polynomial of a graph
• The relation on the coefficients and roots of adjoint polynomial and its application
• Title not available (Why is that?)

This page was built for publication: On the minimum roots of the adjoint polynomials of unicyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4980959)