Some relations between distance-based polynomials of trees

DOI10.2298/BMAT0530001GMaRDI QIDQ5424635zbMATH OpenOpenAlexFDO

Authors Ivan Gutman

Publication date 5 November 2007

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

Full work available at URL https://eudml.org/doc/127895

zbMATH Keywords

vertex degreedistance in graphs

Mathematics Subject Classification ID

Distance in graphs (05C12)

Recommendations

• Inequalities between distance-based graph polynomials
• On some degree-and-distance-based graph invariants of trees
• A lower bound on the degree distance in a tree
• scientific article; zbMATH DE number 1052827
• Some new results on distance-based polynomials

Cited in

(12)

• Distance independence polynomial of graphs
• Deriving M-polynomial based topological descriptors of oral antiviral clinical drug nirmatrelvir
• Comparative analysis of M-polynomial based topological indices between poly hex-derived networks and its subdivision
• VERTEX WEIGHTED WIENER POLYNOMIALS OF THE SUBDIVISION GRAPH AND THE LINE GRAPH OF SUBDIVISION GRAPH OF THE WHEEL GRAPH
• Some new results on distance-based polynomials
• Inequalities between distance-based graph polynomials
• The Hosoya polynomial decomposition for catacondensed benzenoid graphs
• On M-polynomial of the two-dimensional silicon-carbons
• The polygonal cylinder and its Hosoya polynomial
• On the Wiener-like root-indices of graphs
• On the Hosoya polynomial of the third type of the chain hex-derived network
• The Hosoya polynomial decomposition for hexagonal chains

This page was built for publication: Some relations between distance-based polynomials of trees

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