A Note on the Gutman Index of Jaco Graphs
Abstract
The concept of the Gutman index, denoted Gut(G) was introduced for a connected undirected graph G. In this note we apply the concept to the underlying graphs of the family of Jaco graphs, (directed graphs by definition), and describe a recursive formula for the Gutman index Gut(J*n+1(x)). We also determine the Gutman index for the trivial edge-joint between Jaco graphs.
0