Detour polynomials of vertex coalenscence and bridges coalenscence graphs

DOI10.1142/S1793557122500255zbMath1495.05138OpenAlexW3132277818MaRDI QIDQ5064369

No author found.

Publication date: 15 March 2022

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557122500255

zbMATH Keywords

bridgecut vertexdetour distancedetour polynomial

Mathematics Subject Classification ID

Graph polynomials (05C31) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gutman index and detour Gutman index of pseudo-regular graphs
• The connected detour numbers of special classes of connected graphs
• Characterizations of graphs with prescribed connected detour numbers

This page was built for publication: Detour polynomials of vertex coalenscence and bridges coalenscence graphs