Maximum Wiener index of unicyclic graphs with given bipartition

arXiv1902.10661MaRDI QIDQ6314744FDOQ6314744

Jana Maxová, Jan Bok, Nikola Jedličková

Publication date: 27 February 2019

Abstract: The emph{Wiener index} is a widely studied topological index of graphs. One of the main problems in the area is to determine which graphs of given properties attain the extremal values of Wiener index. In this paper we resolve an open problem posed by Du in 2012. To this end we determine the unicyclic bipartite graphs with given size of parts having the maximum Wiener index. This completes the previous research in which the minimum case was solved.

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Extremal combinatorics (05D99)

This page was built for publication: Maximum Wiener index of unicyclic graphs with given bipartition

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