Distance-unbalancedness of graphs
Š Miklavič, P Šparl - Applied Mathematics and Computation, 2021 - Elsevier
In this paper we propose and study a new structural invariant for graphs, called distance-
unbalancedness, as a measure of how much a graph is (un) balanced in terms of distances …
unbalancedness, as a measure of how much a graph is (un) balanced in terms of distances …
Selected topics on Wiener index
M Knor, R Škrekovski, A Tepeh - arXiv preprint arXiv:2303.11405, 2023 - arxiv.org
The Wiener index is defined as the sum of distances between all unordered pairs of vertices
in a graph. It is one of the most recognized and well-researched topological indices, which is …
in a graph. It is one of the most recognized and well-researched topological indices, which is …
Proof of a conjecture on the Wiener index of Eulerian graphs
P Dankelmann - Discrete Applied Mathematics, 2021 - Elsevier
The Wiener index of a connected graph is the sum of the distances between all unordered
pairs of vertices. A connected graph is Eulerian if its vertex degrees are all even. In Gutman …
pairs of vertices. A connected graph is Eulerian if its vertex degrees are all even. In Gutman …
Topological indices of the wreath product of graphs
Y Zhang, J Wang, M Brunetti - Discrete Mathematics, Algorithms and …, 2023 - World Scientific
Topological indices, ie, numerical invariants suitably associated to graphs and only
depending upon their isomorphism type, have important applications in Chemistry. Their …
depending upon their isomorphism type, have important applications in Chemistry. Their …
The structure of graphs with given number of blocks and the maximum Wiener index
The Wiener index (the distance) of a connected graph is the sum of distances between all
pairs of vertices. In this paper, we study the maximum possible value of this invariant among …
pairs of vertices. In this paper, we study the maximum possible value of this invariant among …
Diameter of orientations of graphs with given order and number of blocks
P Dankelmann, MJ Morgan… - arXiv preprint arXiv …, 2022 - arxiv.org
A strong orientation of a graph $ G $ is an assignment of a direction to each edge such that $
G $ is strongly connected. The oriented diameter of $ G $ is the smallest diameter among all …
G $ is strongly connected. The oriented diameter of $ G $ is the smallest diameter among all …
Gutman index–a critical personal account
I Gutman - Bulletin (Académie serbe des sciences et des arts …, 2021 - JSTOR
In the recent literature there are numerous publications concerned with a graph invariant
named “Gutman index”(ZZ). In this paper, some details about the discovery of ZZ are …
named “Gutman index”(ZZ). In this paper, some details about the discovery of ZZ are …
[PDF][PDF] Minimum distance–unbalancedness of the merged graph of C3 and a tree
Z Su, Z Tang - AIMS Mathematics, 2024 - aimspress.com
For a graph G, let nG (u, v) be the number of vertices of G that are strictly closer to u than to v.
The distance–unbalancedness index uB (G) is defined as the sum of| nG (u, v)− nG (v, u) …
The distance–unbalancedness index uB (G) is defined as the sum of| nG (u, v)− nG (v, u) …