Photo by jordansteranka from unsplash
The Wiener index is the sum of distances between all pairs of distinct vertices in a connected graph, which is the oldest topological index related to molecular branching. In this… Click to show full abstract
The Wiener index is the sum of distances between all pairs of distinct vertices in a connected graph, which is the oldest topological index related to molecular branching. In this article, we give a condition to determine the graphs having the smallest Wiener index among all unicyclic graphs given number of pendant vertices, and we also determine the graphs having the smallest Wiener index among all unicyclic graphs given number of cut vertices.
Keywords:
index;
unicyclic graphs;
graphs given;
wiener index;
given number
Journal Title: Journal of Applied Mathematics and Computing
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Journal of Applied Mathematics and Computing
Year Published: 2017
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!