Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs
View through CrossRef
The Gutman index of a connected graph G is defined as Gut(G)=∑u≠vd(u)d(v)d(u,v), where d(u) and d(v) are the degree of the vertices u and v and d(u,v) is the distance between vertices u and v. The Detour Gutman index of a connected graph G is defined as GutG=∑u≠vd(u)d(v)D(u,v), where D(u,v) is the longest distance between vertices u and v. In this paper, the Gutman index and the Detour Gutman index of pseudo-regular graphs are determined.
Title: Gutman Index and Detour Gutman Index of Pseudo-Regular Graphs
Description:
The Gutman index of a connected graph G is defined as Gut(G)=∑u≠vd(u)d(v)d(u,v), where d(u) and d(v) are the degree of the vertices u and v and d(u,v) is the distance between vertices u and v.
The Detour Gutman index of a connected graph G is defined as GutG=∑u≠vd(u)d(v)D(u,v), where D(u,v) is the longest distance between vertices u and v.
In this paper, the Gutman index and the Detour Gutman index of pseudo-regular graphs are determined.
Related Results
Upper Square Free Detour Number of Graphs
Upper Square Free Detour Number of Graphs
In this article we introduce the minimal square free detour sets and investigate the upper square free detour number of a graph. A square free detour set of vertices in a graph is ...
Spectrum Detour Graf N-Partisi Komplit
Spectrum Detour Graf N-Partisi Komplit
Matriks detour dari graf G adalah matriks yang elemen ke-(i,j) merupakan panjang lintasan terpanjang antara titik Vj di G. Himpunan nilai eigen matriks detour dari graf terhubung l...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage
Abstract
Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characteriz...
K-Regular Matroids
K-Regular Matroids
<p>The class of matroids representable over all fields is the class of regular matroids. The class of matroids representable over all fields except perhaps GF(2) is the class...
The Vertex Gutman Index and Gutman Index of the Union of Two Cycles
The Vertex Gutman Index and Gutman Index of the Union of Two Cycles
The Wiener index is one of the most classic and widely used indicators in topology. It reflects the average distance of any node pair in the graph. It not only makes the boundaries...
Detour Number of 1-Fault Connected Graphs
Detour Number of 1-Fault Connected Graphs
A subset S of a connected graph G of order n is called a detour set of G if for every vertex x in G there exist vertices u; v in S such that x lie on a u – v detour path. The detou...