Add to ORKGThe concepts of detour d-critical graphs, detour d-decreasing graphs, detour d-increasing graphs, detour d-changing graphs and detour diameter minimal graphs are introduced by Linda J. P and M. S. Sunitha in [7]. In this paper a characterization of detour d-changing graphs is obtained. The concepts of detour trail number and detour number are introduced. Then detour trail number and detour number of some well known graphs are obtained
In this paper the concepts of fuzzy detour closure, fuzzy detour geodetic iteration number, fuzzy de...
Certain general properties of the detour distance, weak edge detour set, connected weak edge detour ...
The detour matrix (DD) of a graph has for its (i,j) entry the length of the longest path between ver...
AbstractThe detour order (of a vertex v) of a graph G is the order of a longest path (beginning at v...
Abstract: For two vertices u and v in a graph G = (V,E), the distance d(u, v) and detour distance D(...
For two vertices u and v in a graph G = (V,E), the detour distance D(u,v) is the length of a longest...
The number of -sets that belongs to in G is defined as the detour domination value of indicated by ...
For vertices x and y in a connected graph G, the detour distance D(x,y) is the length of a longest x...
The detour matrix (DD) of a graph has for its (i,j) entry the length of the longest path between ver...
For distinct vertices u and v of a nontrivial connected graph G, the detour distance D(u, v) between...
Abstract. The vertex version of detour index was defined during the works on connected graph in chem...
The detour matrix of a weighted graph and its invariants (the detour polynomial, the detour spectrum...
By a graph G = (V,E), we mean a finite undirected graph without loops or multiple edges. The order a...
We introduce the concept of the total edge fixing edge-to-vertex detour setof a connected graph . Le...
A detour of a graph is a path of maximum length. A vertex that is common to all detours of a graph i...
In this paper the concepts of fuzzy detour closure, fuzzy detour geodetic iteration number, fuzzy de...
Certain general properties of the detour distance, weak edge detour set, connected weak edge detour ...
The detour matrix (DD) of a graph has for its (i,j) entry the length of the longest path between ver...
AbstractThe detour order (of a vertex v) of a graph G is the order of a longest path (beginning at v...
Abstract: For two vertices u and v in a graph G = (V,E), the distance d(u, v) and detour distance D(...
For two vertices u and v in a graph G = (V,E), the detour distance D(u,v) is the length of a longest...
The number of -sets that belongs to in G is defined as the detour domination value of indicated by ...
For vertices x and y in a connected graph G, the detour distance D(x,y) is the length of a longest x...
The detour matrix (DD) of a graph has for its (i,j) entry the length of the longest path between ver...
For distinct vertices u and v of a nontrivial connected graph G, the detour distance D(u, v) between...
Abstract. The vertex version of detour index was defined during the works on connected graph in chem...
The detour matrix of a weighted graph and its invariants (the detour polynomial, the detour spectrum...
By a graph G = (V,E), we mean a finite undirected graph without loops or multiple edges. The order a...
We introduce the concept of the total edge fixing edge-to-vertex detour setof a connected graph . Le...
A detour of a graph is a path of maximum length. A vertex that is common to all detours of a graph i...
In this paper the concepts of fuzzy detour closure, fuzzy detour geodetic iteration number, fuzzy de...
Certain general properties of the detour distance, weak edge detour set, connected weak edge detour ...
The detour matrix (DD) of a graph has for its (i,j) entry the length of the longest path between ver...