Aug 10, 2017 · The upper connected x-detour monophonic number of G, denoted by cdm+ x (G), is defined to be the maximum cardinality of a minimal connected x- ...
People also ask
What is the detour number of a graph?
What is the total monophonic number of a graph?
What are the vertices of a graph?
What is a graph in which each vertex has the same number of neighbors?
The upper detour monophonic number of G, denoted by d m + ( G ) , is defined as the maximum cardinality of a minimal detour monophonic set of G. We determine ...
The upper detour monophonic number of G, denoted by d m + ( G ) , is defined as the maximum cardinality of a minimal detour monophonic set of G. We determine ...
From Table 3.1 , the forcing vertex detour monophonic number and the upper forcing vertex detour monophonic number of a graph are different. Next we present ...
A longest x − y monophonic path is called an x − y detour monophonic path. A set S of vertices of a graph G is a detour monophonic set if each vertex v of ...
The upper connected x-detour monophonic number of G, denoted by cdm+ x (G), is defined to be the maximum cardinality of a minimal connected x-detour monophonic ...
Mar 9, 2021 · A vertex x of a connected graph G is said to be a detour sim- plicial vertex of G if x is not an internal vertex of any u-v detour monophonic ...
For a connected graph G = (V,E) of order at least three, the monophonic distance dm(u, v) is the length of a longest u− v monophonic path in G. For subsets ...
The upper detour monophonic number of G, denoted by , is defined as the maximum cardinality of a minimal detour monophonic set of G. We determine bounds for it ...
Theorem 1.2. [3] Each semi-extreme vertex of a graph G belongs to every edge detour monophonic set of G.