Abstract

The concept of the \emph{Gutman index}, denoted Gut(G)Gut(G) was introduced for a connected undirected graph GG. In this note we apply the concept to the underlying graphs of the family of Jaco graphs, (\emph{directed graphs by definition}), and describe a recursive formula for the \emph{Gutman index} Gut(Jn+1∗(x)).Gut(J^*_{n+1}(x)). We also determine the \emph{Gutman index} for the trivial \emph{edge-joint} between Jaco graphs.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.