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
Extremal trees with fixed degree sequence
TL;DR: In this article, the authors provide a general theorem that covers a large family of invariants for which the greedy tree or the M-tree is extremal among trees with degree sequence $D with respect to various graph invariants.
Journal ArticleDOI
Degree resistance distance of trees with some given parameters
Fangguo He,Xinnong Jiang +1 more
TL;DR: In this article, the authors characterized the extremal graphs with respect to degree resistance distance among trees with given diameter, number of pendent vertices, independence number, covering number, and maximum degree.
Journal ArticleDOI
On the average eccentricity, the harmonic index and the largest signless Laplacian eigenvalue of a graph
TL;DR: In this article, the authors determined the unique tree with minimum average eccentricity among the set of trees with given number of pendent vertices and the unique Tree with maximum average ǫ-eccentricity among trees with two adjacent vertices of maximum degree.
Journal ArticleDOI
On symmetric division deg index of trees with given parameters
Jianwei Du,Xiaoling Sun +1 more
TL;DR: In this article, the maximum symmetric division deg (SDD) index of trees with given matching number or domination number or independence number or number of pendant vertices or segments or diameter or radius are presented.
Journal Article
Recognition and Combinatorial Optimization Algorithms for Bipartite Chain Graphs
TL;DR: This paper gives a recognition algorithm in O(n(n+m) time for bipartite chain graphs, and directly calculate the density of such graphs, for their stability number and domination number.
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.