H Lin - MATCH Commun. Math. Comput. Chem, 2024 - match.pmf.kg.ac.rs
The Wiener index of a connected graph is defined as the sum of distances between all unordered pairs of its vertices. In this paper, we survey the known extremal results about the …
The partial Hosoya polynomial (or briefly the partial H-polynomial) can be used to construct the well-known Hosoya polynomial. The ith coefficient of this polynomial, defined for an …
This article aims to be a further contribution to the research on structural complexity networks. Here, we emphasize measures to determine symmetry. The so-called “orbit …
The definition of orbit polynomial is based on the size of orbits of a graph which is OG (x)=∑ ix| O i|, where O 1,…, O k are all orbits of graph G. It is a well-known fact that according to …
The Wiener polynomial of a connected graph G is the polynomial W (G; x)=∑ i= 1 D (G) di (G) xi where D (G) is the diameter of G, and di (G) is the number of pairs of vertices of G at …