No label defined (Q4948668)

The authors consider connected undirected graphs \(G = (V(G), E(G))\) without loops and multiple edges. Let \({\mathcal G}_p\) be the class of all connected graphs on \(p\) vertices, different from a circuit. The line graph \(L(G)\) of a graph \(G\) has the set of vertices \(V(L(G)) = E(G)\), and two distinct vertices of \(L(G)\) are adjacent if and only if the corresponding edges of \(G\) share a common endvertex. The Wiener number \(W(G)\) of the graph \(G\) is the sum of the distances between all pairs of its vertices, where the distance between two vertices is equal to the length of a shortest path between them. In the article, graphs \(G \in {\mathcal G}_p\) satisfying the condition \(W(G) = W(L(G))\) are discussed. It is proven that such graphs exist only for \(p \geq 9\). Moreover, the number of such graphs is equal to \(26\) for \(p=9\) and \(166\) for \(p=10\). Each of these graphs is bicyclic, i.e., the cyclomatic number equals two. The number of bicyclic graphs satisfying the above condition is equal to \(503\) for \(p=11\) and \(1082\) for \(p=12\). Diagrams of all \(26\) graphs for \(p=9\) and bicyclic parts (which are obtained by removing tree-like branches) of graphs for \(9 \leq p \leq 12\) are pictured.