The extremal graphs of order trees and their topological indices

DOI10.1016/J.AMC.2021.125988arXiv2010.03981MaRDI QIDQ6350820FDOQ6350820

Authors: Rui Song, Qiongxiang Huang, Peng Wang 

Publication date: 6 October 2020

Abstract: Recently, D. Vuki$checkc$evi$acutec$ and J. Sedlar in cite{Vuki} introduced an order "$preceq$" on $mathcal{T}_n$, the set of trees on $n$ vertices, such that the topological index $F$ of a graph is a function defined on the order set $langlemathcal{T}_n,preceqangle$. It provides a new approach to determine the extremal graphs with respect to topological index $F$. By using the method they determined the common maximum and/or minimum graphs of $mathcal{T}_n$ with respect to topological indices of Wiener type and anti-Wiener type. Motivated by their researches we further study the order set $langlemathcal{T}_n,preceqangle$ and give a criterion to determine its order, which enable us to get the common extremal graphs in four prescribed subclasses of $langlemathcal{T}_n,preceqangle$. All these extremal graphs are confirmed to be the common maximum and/or minimum graphs with respect to the topological indices of Wiener type and anti-Wiener type. Additionally, we calculate the exact values of Wiener index for the extremal graphs in the order sets $langlemathcalC(n,k),preceqangle$, $langlemathcal{T}_n(q),preceqangle$ and $langlemathcal{T}_n^{D}elta,preceqangle$.

Mathematics Subject Classification ID

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

This page was built for publication: The extremal graphs of order trees and their topological indices

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