Journal ArticleDOI
Wiener Index of Trees: Theory and Applications
Reads0
Chats0
TLDR
The Wiener index W is the sum of distances between all pairs of vertices of a (connected) graph as discussed by the authors, defined as the distance between all vertices in a graph.Abstract:
The Wiener index W is the sum of distances between all pairs of vertices of a (connected) graph. The paper outlines the results known for W of trees: methods for computation of W and combinatorial expressions for W for various classes of trees, the isomorphism–discriminating power of W, connections between W and the center and centroid of a tree, as well as between W and the Laplacian eigenvalues, results on the Wiener indices of the line graphs of trees, on trees extremal w.r.t. W, and on integers which cannot be Wiener indices of trees. A few conjectures and open problems are mentioned, as well as the applications of W in chemistry, communication theory and elsewhere.read more
Citations
More filters
Posted Content
On Terminal Hosoya Polynomial of Some Thorn Graphs
TL;DR: In this paper, the terminal Hosoya polynomial for caterpillars, thorn stars and thorn rings was obtained, and the result generalizes the existing results for the same class of worms.
Journal ArticleDOI
Some Algebraic Polynomials and Topological Indices of Möbius Ladder
Muhammad Asif Tahir,Saba Noreen +1 more
TL;DR: In this article, some Zagreb type polynomials of Möbius Ladder were computed and the redefined Zagrove indices were computed for the first time.
On the Edge Reverse Wiener Numbers of a Graph
TL;DR: In this paper, the edge versions of reverse Wiener numbers e RW and e CW due to distances matrices e RD and e CD were introduced, and several results about the relations among them and edge Wiener number were presented.
Journal ArticleDOI
Wiener, Hyper Wiener and Detour Index of Pseudoregular Graphs
S. Kavithaa,V. Kaladevi +1 more
TL;DR: In this article, the authors defined the Wiener, Hyper Wiener and Detour indices for pseudo-regular polygonal graphs, where each vertex represents an atom of the molecule and covalent bonds between atoms are represented by edges between the corresponding vertices.
References
More filters
Journal ArticleDOI
Laplacian matrices of graphs: a survey
TL;DR: In this paper, the authors survey some of the many results known for Laplacian matrices, and present a survey of the most important results in the field of graph analysis.
THE LAPLACIAN SPECTRUM OF GRAPHS y
TL;DR: A survey of known results about the spectrum of the Laplacian matrix of graphs with special emphasis on the second smallest Lapla-cian eigenvalue 2 and its relation to numerous graph invariants, including connectivity, expanding properties, isoperimetric number, maximum cut, independence number, genus, diameter, mean distance, and bandwidth-type parameters of a graph is given in this article.
Book
Mathematical concepts in organic chemistry
Ivan Gutman,Oskar E. Polansky +1 more
TL;DR: In this paper, the authors define the topology of a graph as follows: 1.1 Topology in Chemistry, 2.2 Geometry, Symmetry, Topology, Graph Automorphisms, and Graph Topology.