On minimum Wiener polarity index of unicyclic graphs with prescribed maximum degree
Summary: The Wiener polarity index of a connected graph \(G\) is defined as the number of its pairs of vertices that are at distance three. By introducing some graph transformations, in different way with that of \textit{Y. Huang} et al. [Util. Math. 92, 193--205 (2013; Zbl 1293.05079)], we determine the minimum Wiener polarity index of unicyclic graphs with any given maximum degree and girth, and characterize extremal graphs. These observations lead to the determination of the minimum Wiener polarity index of unicyclic graphs and the characterization of the extremal graphs.
- Algorithms and extremal problem on Wiener polarity index
- Graph theory
- scientific article; zbMATH DE number 6127688 (Why is no real title available?)
- On the Wiener polarity index of trees with maximum degree or given number of leaves
- On the Wiener polarity index of unicyclic graphs
- The maximum Wiener polarity index of trees with \(k\) pendants
- The maximum Wiener polarity index of unicyclic graphs
- Topology in chemistry. Discrete mathematics in molecules.
- Wiener polarity index of fullerenes and hexagonal systems
This page was built for publication: On minimum Wiener polarity index of unicyclic graphs with prescribed maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336331)