2000 character limit reached
A Note on the Gutman Index of Jaco Graphs
Published 25 Feb 2015 in math.CO | (1502.07093v2)
Abstract: The concept of the \emph{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, (\emph{directed graphs by definition}), and describe a recursive formula for the \emph{Gutman index} $Gut(J*_{n+1}(x)).$ We also determine the \emph{Gutman index} for the trivial \emph{edge-joint} between Jaco graphs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.