Inequalities between distance-based graph polynomials

DOI10.2298/BMAT0631057GMaRDI QIDQ5299377zbMATH OpenFDO

Authors Ivan Gutman, Olga Miljković, Bo Zhou, Miroslav Petrović

Publication date 25 June 2013

Published in Bulletin: Classe des sciences mathematiques et natturalles (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/BMAT0631057G

zbMATH Keywords

graph polynomial

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Recommendations

• Some new results on distance-based polynomials
• On the roots of Hosoya polynomial of a graph
• Some relations between distance-based polynomials of trees
• The Hosoya polynomial decomposition for hexagonal chains
• The Hosoya polynomial decomposition for catacondensed benzenoid graphs

Cited in

(4)

• Properties of graph distance measures by means of discrete inequalities
• Some new results on distance-based polynomials
• Some relations between distance-based polynomials of trees
• Extremal Results on Vertex and Link Residual Closeness

This page was built for publication: Inequalities between distance-based graph polynomials

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