Graph connectivity and Wiener index
Lists
Only you see this
Abstract
The graphs with a given number n of vertices and given (vertex or edge) connectivity k, having minimum Wiener index are determined. In both cases this is Kk + (K1 U Kn-k-1), the graph obtained by connecting all vertices of the complete graph Kk with all vertices of the graph whose two components are Kn-k-1 and K1. AMS Mathematics Subject Classification (2000): 05C12, 05C40 05C35.
BibTeX
@article{gutman2006graph,
author = {İvan Gutman and Shizhou Zhang},
title = {{Graph connectivity and Wiener index}},
journal = {Bulletin},
year = {2006},
doi = {10.2298/bmat0631001g},
}Loading related content...