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
Graphs with at most two moplexes
Graphs with at most two moplexes
AbstractA moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. The notion is known to be closely related to...
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 ...
On the total and conformable colorings of line regular graphs
On the total and conformable colorings of line regular graphs
A conformable coloring of a $k$-regular graph $G=(V,E)$ is a $(k+1)$-vertex coloring in which every color class (including empty ones) has cardinality the same parity as $|V|$; su...
The open detour number of a graph
The open detour number of a graph
A set [Formula: see text] is called an open detour set of [Formula: see text] if for each vertex [Formula: see text] in [Formula: see text], either (1) [Formula: see text] is a det...
Weakly Modular Graphs and Nonpositive Curvature
Weakly Modular Graphs and Nonpositive Curvature
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying t...
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...
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...
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...