CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND

COMPUTER SCIENCES
https://cajmtcs.centralasianstudies.org

Volume: 04 Issue: 9 | Sep 2023 ISSN: 2660-5309

MONOPHONIC DISTANCE
Mohammed Khalid Yaqoob
Mathematics, Algebra Graph

Abstract ARTICLEINFO
A 𝑢 𝑣 path is monophonic if it has no chords for any two Article history:
vertices 𝑢 and 𝑣 in a connected graph 𝐺, and the monophonic Received 23 Jul 2023
distance 𝑑𝑚 (𝑢, 𝑣) is the length of the longest 𝑢 𝑣 monophonic Revised form 25 Aug 2023
Accepted 27 Sep 2023
path in 𝐺. The monophonic eccentricity of each vertex 𝑣 in 𝐺
is given by 𝑒𝑚 (𝑣) = 𝑚𝑎𝑥 𝑑𝑚 (𝑢, 𝑣): 𝑢 𝑉. It is demonstrated
that the monophonic center of a graph exists in every graph.
The subgraph created by the vertices of 𝐺 exhibiting minimal
monophonic eccentricity is the monophonic center of 𝐺.
Additionally, it is demonstrated that each connected graph 𝐺
monophonic center is located within one of its blocks.

© 2023 Hosting by Central Asian Studies. All rights reserved.

---------------------------------------------------------------------***---------------------------------------------------------------------
1. INTRODUCTION
We take a finite connected graph with no loops and many edges, denoted by 𝐺 = (𝑉(𝐺), 𝐸(𝐺)). The letters
𝑝 and 𝑞, respectively, stand for the order and size of 𝐺. The length of the shortest 𝑢 − 𝑣 path in 𝐺 is used to
define the distance 𝑑(𝑢, 𝑣) between 𝑢 and 𝑣.
The radius 𝑟𝑎𝑑 𝐺 𝑜𝑓 𝐺 is the vertices of G is minimum. eccentricity, and the diameter 𝑑𝑖𝑎𝑚 𝐺 𝑜𝑓 𝐺 is the
maximum eccentricity among the vertices of 𝐺.
1.1. Definition. An edge 𝑢𝑖 𝑢𝑗 with 𝑗 ≥ 𝑖 + 2 is a chord of a path 𝑢1 , 𝑢2 , . . . , 𝑢𝑛 in a connected graph 𝐺.
If a 𝑢 − 𝑣 path 𝑃 is chord less, it is referred to as a monophonic path. The monophonic distance from 𝑢 𝑡𝑜 𝑣,
abbreviated as 𝑑𝑚(𝑢, 𝑣), is the length of the longest 𝑢 − 𝑣 monophonic path. A 𝑢 − 𝑣 monophonic path is
defined as one whose length is equal to 𝑑𝑚(𝑢, 𝑣) .
1.2. Example. In 𝑡ℎ𝑒 𝑔𝑟𝑎𝑝ℎ 𝐺 𝑔𝑖𝑣𝑒𝑛 𝑖𝑛 Figure 1.1. we can 𝑒𝑎𝑠𝑖𝑙𝑦 check that 𝑑(𝑣1 , 𝑣4 ) = 2, 𝐷(𝑣1 , 𝑣4 ) =
6, and 𝑑𝑚 (𝑣1 , 𝑣4 ) = 4. 𝑇ℎ𝑒 𝑚𝑜𝑛𝑜𝑝ℎ𝑜𝑛𝑖𝑐 𝑝𝑎𝑡ℎ 𝑃 : 𝑣1 , 𝑣2 , 𝑣8 , 𝑣7 ,𝑣4 is 𝑣1 − 𝑣4 monophonic while the
monophonic path 𝑄 : 𝑣1 , 𝑣3 , 𝑣4 is not 𝑣1 − 𝑣4 monophonic.
The usual distance 𝑑 𝑎𝑟𝑒 𝑚𝑒𝑡𝑟𝑖𝑐𝑠 𝑜𝑛 𝑡ℎ𝑒 𝑣𝑒𝑟𝑡𝑒𝑥 𝑠𝑒𝑡 𝑉 𝑜𝑓 𝑎 𝑐𝑜𝑛𝑛𝑒𝑐𝑡𝑒𝑑 𝑔𝑟𝑎𝑝ℎ 𝐺,
𝑤ℎ𝑒𝑟𝑒𝑎𝑠 𝑡ℎ𝑒 𝑚𝑜𝑛𝑜𝑝ℎ𝑜𝑛𝑖𝑐 𝑑𝑖𝑠𝑡𝑎𝑛𝑐𝑒 𝑑𝑚 not based on metrics 𝑉. To get the graph 𝐺 given in Fig 1.1,
𝑑𝑚(𝑣4 , 𝑣6 ) = 5, 𝑑𝑚(𝑣4 , 𝑣5 ) = 1 and 𝑑𝑚(𝑣5 , 𝑣6 ) = 1. Hence 𝑑𝑚(𝑣4 , 𝑣6 ) > 𝑑𝑚(𝑣4 , 𝑣5 ) +
𝑑𝑚(𝑣5 , 𝑣6 ), 𝑎𝑛𝑑 𝑠𝑜 𝑡ℎ𝑒 𝑡𝑟𝑖𝑎𝑛𝑔𝑙𝑒 𝑖𝑛𝑒𝑞𝑢𝑎𝑙𝑖𝑡𝑦 𝑖𝑠 𝑛𝑜𝑡 𝑠𝑎𝑡𝑖𝑠𝑓𝑖𝑒𝑑 .

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 64

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 09 | Sep 2023

Figure 2.1.1
1.3. Result. 𝐿𝑒𝑡 𝑢 𝑎𝑛𝑑 𝑣 𝑏𝑒 𝑡𝑤𝑜 𝑣𝑒𝑟𝑡𝑖𝑐𝑒𝑠 𝑖𝑛 𝑎 𝑔𝑟𝑎𝑝ℎ 𝐺. 𝑇ℎ𝑒𝑛
1. 𝑑𝑚(𝑢, 𝑣) = 0 if and only if 𝑢 = 𝑣.
2. 𝑑𝑚(𝑢, 𝑣) = 1 if and only if 𝑢𝑣 is an edge of 𝐺
3. 𝑑𝑚(𝑢, 𝑣) = 𝑝 − 1 𝑖𝑓 𝑎𝑛𝑑 𝑜𝑛𝑙𝑦 𝑖𝑓 𝐺 𝑖𝑠 𝑡ℎ𝑒 𝑝𝑎𝑡ℎ 𝑤𝑖𝑡ℎ 𝑒𝑛𝑑𝑣𝑒𝑟𝑡𝑖𝑐𝑒𝑠 𝑢 𝑎𝑛𝑑 𝑣
4. 𝑑𝑚(𝑢, 𝑣) = 𝑑𝑚(𝑢, 𝑣) = 𝐷(𝑢, 𝑣) 𝑖𝑓 𝑎𝑛𝑑 𝑜𝑛𝑙𝑦 𝑖𝑓 𝐺 𝑖𝑠 𝑎 𝑡𝑟𝑒𝑒.
1.4. Definition. The monophonic eccentricity of each vertex 𝑣 in a connected graph 𝐺 is given by
𝑒𝑚 (𝑣) = 𝑚𝑎𝑥 {𝑑𝑚 (𝑢, 𝑣): 𝑢 ∈ 𝑉. A monophonic eccentric vertex of 𝑣 is one where 𝑑𝑚 (𝑢, 𝑣) = 𝑒𝑚 (𝑣)
for the vertex 𝑢 of 𝐺. The formulas 𝑟𝑎𝑑𝑚 𝐺 = 𝑚𝑖𝑛 {𝑒𝑚 (𝑣): 𝑣 ∈ 𝑉} and 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑚𝑎𝑥 {𝑒𝑚 (𝑣): 𝑣 ∈
𝑉}, respectively, determine the monophonic radius and diameter of 𝐺 .
1.5. Example. We will use a condensed explanation in this example, as indicated in table 1.1. The graph
𝐺 provided is shown in along with the vertices' eccentricities and monophonic distances in a monophonic
manner. Note that 𝑟𝑎𝑑𝑚 𝐺 = 3 and 𝑑𝑖𝑎𝑚𝑚 𝐺 = 5 .
𝑑𝑚 (𝑣𝑖 , 𝑣𝑗 ) 𝑣1 𝑣2 𝑣3 𝑣4 𝑣5 𝑣6 𝑣7 𝑣8 𝑒𝑚(𝑣)

𝑣1 0 1 1 4 1 4 3 4 4

𝑣2 1 0 4 3 1 5 4 1 5

𝑣3 1 4 0 1 2 4 4 4 4

𝑣4 4 3 1 0 1 5 1 4 5

𝑣5 1 1 2 1 0 1 3 3 3

𝑣6 4 5 4 5 1 0 1 1 5

𝑣7 3 4 4 1 3 1 0 1 4

𝑣8 4 1 4 4 3 1 1 0 4

Table 1.1. Figure 1.1 shows the monophonic eccentricities of the graph 𝐺 vertices.

1.6. Note. In a tree 𝑇, there is only one path between any two vertices, 𝑢 and 𝑣, and so 𝑑(𝑢, 𝑣) =
𝑑𝑚(𝑢, 𝑣) = 𝐷(𝑢, 𝑣). 𝐻𝑒𝑛𝑐𝑒 𝑟𝑎𝑑 𝑇 = 𝑟𝑎𝑑𝑚 𝑇 = 𝑟𝑎𝑑𝐷 𝑇 𝑎𝑛𝑑 𝑑𝑖𝑎𝑚 𝑇 = 𝑑𝑖𝑎𝑚𝑚 𝑇 = 𝑑𝑖𝑎𝑚𝐷 𝑇.
Table 2.1.2 lists the monophonic diameter and monophonic radius of a few common graphs.

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 65

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 09 | Sep 2023

Table 1.2. Several common graphs' monophonic diameter and radius

1.7. Theorem. (a) If 𝑎, 𝑏 𝑎𝑛𝑑 𝑐 are 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠 with 3 ≤ 𝑎 ≤ 𝑏 ≤ 𝑐, then a connected graph exists 𝐺
such that 𝑟𝑎𝑑 𝐺 = 𝑎, 𝑟𝑎𝑑𝑚 𝐺 = 𝑏 𝑎𝑛𝑑 𝑟𝑎𝑑𝐷 𝐺 = 𝑐.
(b)If 𝑎, 𝑏 and 𝑐 are 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠 with 5 ≤ 𝑎 ≤ 𝑏 ≤ 𝑐, then a connected graph appears. G exists in such a
way that 𝑑𝑖𝑎𝑚 𝐺 = 𝑎, 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑏 𝑎𝑛𝑑 𝑑𝑖𝑎𝑚𝐷 𝐺 = 𝑐.
Proof. (a) Three examples are used to demonstrate the conclusion.
Case (i) 3 ≤ 𝑎 = 𝑏 = 𝑐. 𝐶𝑜𝑛𝑠𝑖𝑑𝑒𝑟. 𝐺 = 𝑃2𝑎+1 , path,of order 2𝑎 + 1. It is clear that 𝑟𝑎𝑑 𝐺 =
𝑟𝑎𝑑𝑚 𝐺 = 𝑟𝑎𝑑𝐷 𝐺 = 𝑎.
"Case (ii) 3 ≤ 𝑎 ≤ 𝑏 < 𝑐. Let 𝐹1 ∶ 𝑢1 , 𝑢2 , … , 𝑢𝑎−1 and 𝐹2 ∶ 𝑣1 , 𝑣2 , … , 𝑣𝑎−1 be two copies of the path
𝑃𝑎−1 of order 𝑎 – 1. Let 𝐹3 ∶ 𝑤1 , 𝑤2 , … , 𝑤𝑏−𝑎+3 𝑎𝑛𝑑 𝐹4 ∶ 𝑧1 , 𝑧2 , … , 𝑧𝑏−𝑎+3 two duplicates of the path
𝑃𝑏−𝑎+3 of order 𝑏 − 𝑎 + 3, and 𝐹5 = 𝐾𝑐−𝑏+1 the complete graph of order 𝑐 − 𝑏 + 1 with 𝑉(𝐹5 ) =
{𝑥1 , 𝑥2 , … , 𝑥𝑐−𝑏+1 }. We construct the graph 𝐺 as follows : (i) identify the vertices 𝑥1 in 𝐹5 and 𝑤1 in 𝐹3 ; also
identify the vertices 𝑥𝑐−𝑏+1 in 𝐹5 and 𝑧1 in 𝐹4 ; (ii) identify the vertices 𝑤𝑏−𝑎+3 in 𝐹3 𝑎𝑛𝑑 𝑢2 𝑖𝑛 𝐹1 , and
identify the vertices 𝑧𝑏−𝑎+3 in 𝐹4 and 𝑣2 in 𝐹2 ; and (iii) join each vertex 𝑤𝑖 (1 ≤ 𝑖 ≤ 𝑏 − 𝑎 + 2) in 𝐹3 and
𝑢1 in 𝐹1 , and join each vertex 𝑧𝑖 (1 ≤ 𝑖 ≤ 𝑏 − 𝑎 + 2) in 𝐹4 and 𝑣1 in 𝐹2 . The resulting graph 𝐺 is shown in
Figure 1.2. It is easily verified that 𝑒(𝑣) = 𝑎 if 𝑣 ∈ 𝑉(𝐹5 ); 𝑒(𝑣) > 𝑎 if 𝑣 ∈ 𝑉(𝐺) − 𝑉(𝐹5 ), 𝑒𝑚 (v) =
𝑏 𝑖𝑓 𝑣 ∈ 𝑉(𝐹5 ); 𝑒𝑚 (𝑣) > 𝑏 𝑖𝑓 𝑣 ∈ 𝑉(𝐺) − 𝑉(𝐹_5) 𝑎𝑛𝑑 𝑒_𝐷 (𝑣) = 𝑐 𝑖𝑓 𝑣 ∈ 𝑉(𝐹5) ; and 𝑒𝐷 (𝑣) >
𝑐 𝑖𝑓 𝑣 ∈ 𝑉(𝐺) − 𝑉(𝐹5 ). It follows that 𝑟𝑎𝑑 𝐺 = 𝑎, 𝑟𝑎𝑑𝑚 𝐺 = 𝑏, 𝑎𝑛𝑑 𝑟𝑎𝑑𝐷 𝐺 = 𝑐"
"Case (iii) 3 ≤ 𝑎 < 𝑏 = 𝑐. 𝐿𝑒𝑡 𝐸1 ∶ 𝑣1 , 𝑣2 , … , 𝑣2𝑎+1 be a path of order 2𝑎 + 1. 𝐿𝑒𝑡 𝐸2 ∶
𝑢1 , 𝑢2 , … , 𝑢𝑏−𝑎+3 𝑎𝑛𝑑 𝐸3 ∶ 𝑤1 , 𝑤2 , … , 𝑤𝑏−𝑎+3 be two copies of the path 𝑃𝑏−𝑎+3 of order 𝑏 − 𝑎 + 3, and
𝑙𝑒𝑡 𝐸𝑖 (4 ≤ 𝑖 ≤ 2 (𝑏 − 𝑎) + 3) be 2(𝑏 − 𝑎) copies of 𝐾1 . We construct the graph 𝐺 as follows : (i)
identify the vertices 𝑣𝑎+1 in 𝐸1 , 𝑢1 𝑖𝑛 𝐸2 , and 𝑤1 𝑖𝑛 𝐸3 ; (ii) identify the vertices 𝑣𝑎−1 in 𝐸1 and
𝑢𝑏−𝑎+3 𝑖𝑛 𝐸2 , and identify the vertices 𝑣𝑎+3 𝑖𝑛 𝐸1 and 𝑤𝑏−𝑎+3 in 𝐸3 ; and (iii) join each 𝐸𝑖 (4 ≤ 𝑖 ≤ 𝑏 −
𝑎 + 3) with 𝑣𝑎+1 in 𝐸1 and 𝑢𝑖 − 1𝑖−1 𝑖𝑛 𝐸2 , and join each 𝐸𝑖 (𝑏 − 𝑎 + 4 ≤ 𝑖 ≤ 2(𝑏 − 𝑎) + 3) with
𝑣𝑎+1 in 𝐸1 and 𝑤𝑖−𝑏+𝑎−1 in 𝐸3 . The final graph, 𝐺, is displayed in Figure 1.3."

Fig 1.2. a.graph 𝑮 in 𝑪𝒂𝒔𝒆(ii) of.Theorem(a).

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 66

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 09 | Sep 2023

Fig 1.3. a.graph 𝑮 in 𝑪𝒂𝒔𝒆(iii) of.Theorem(a).

It is simple to confirm that 𝑒(𝑣𝑎+1 ) = 𝑎; 𝑒(𝑣) > 𝑎 𝑖𝑓 𝑣 ∈ 𝑉(𝐺) − {𝑣𝑎+1 }; 𝑒𝑚 (𝑣𝑎+1 ) = 𝑏; 𝑒𝑚 (𝑣) >
𝑏 𝑖𝑓 𝑣 ∈ 𝑉(𝐺) − {𝑣𝑎+1 }, 𝑎𝑛𝑑 𝑒𝐷 (𝑣𝑎+1 ) = 𝑐; 𝑎𝑛𝑑 𝑒𝐷 (𝑣) > 𝑐 𝑖𝑓 𝑣 ∈ 𝑉(𝐺) − {𝑣𝑎+1 }. It follows that
𝑟𝑎𝑑 𝐺 = 𝑎, 𝑟𝑎𝑑𝑚 𝐺 = 𝑏, 𝑎𝑛𝑑 𝑟𝑎𝑑𝐷 𝐺 = 𝑐.
(b) By taking into account three situations, this result is also demonstrated.
Case (i) 5 ≤ 𝑎 = 𝑏 = 𝑐. Let 𝐺 be a path of.order 𝑎 + 1. Then 𝑑𝑖𝑎𝑚 𝐺 = 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑑𝑖𝑎𝑚𝐷 𝐺 = 𝑎.
Case (ii) 5 ≤ a ≤ b < c let 𝐹1 : 𝑢1 , 𝑢2 , … , 𝑢𝑎−1 be the.path 𝑃𝑎−1 of order 𝑎 − 1; 𝐹2 : 𝑤1 , 𝑤2 , . . . , 𝑤𝑏−𝑎+3 be
the.path 𝑃𝑏−𝑎+3 of.order 𝑏 − 𝑎 + 3 ; and 𝐹3 ∶ 𝐾𝑐−𝑏+1 be the full graph.of order The graph 𝐺 is created as
follows : I Identify the.vertices 𝑤𝑏−𝑎+3 in 𝐹2 and 𝑢2 in 𝐹1 ; (ii) join each.vertex 𝑤𝑖 (1 ≤ 𝑖 ≤ 𝑏 − 𝑎 +
2) in 𝐹2 and 𝑢1 in 𝐹1 ; and (iii) identify the vertices 𝑥1 in 𝐹3 and 𝑤1 in 𝐹2 ; Figure 2.1.4 displays the final
graph 𝐺.
It is easily verified that 𝑒(𝑣) = 𝑎 𝑖𝑓 𝑣 ∈ (𝑉(𝐹3 ) − {𝑥1 }) ∪ {𝑢𝑎−1 }; 𝑒(𝑣) < 𝑎 𝑖𝑓 𝑣 ∈ 𝑉(𝐹2 ) ∪
(𝑉(𝐹1 ) − {𝑢𝑎−1 }), and 𝑒𝑚 (𝑣) = 𝑏 𝑖𝑓 𝑣 ∈ (𝑉(𝐹3 ) − {𝑥1 }) ∪ {𝑢𝑎−1 }; 𝑒𝑚 (𝑣) < 𝑏 𝑖𝑓 𝑣 ∈ 𝑉(𝐹2 ) ∪
(𝑉(𝐹1 ) − {𝑢𝑎−1 }), 𝑎𝑛𝑑 𝑒𝐷 (𝑣) = 𝑐 𝑖𝑓 𝑣 ∈ (𝑉(𝐹3 ) − {𝑥1 }) ∪ {𝑢𝑎−1 }; 𝑎𝑛𝑑 𝑒𝐷 (𝑣) < 𝑐 𝑖𝑓 𝑣 ∈
𝑉(𝐹2 ) ∪ (𝑉(𝐹1 ) − {𝑢𝑎−1 }). 𝐼𝑡 𝑓𝑜𝑙𝑙𝑜𝑤𝑠 𝑡ℎ𝑎𝑡 𝑑𝑖𝑎𝑚 𝐺 = 𝑎, 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑏 𝑎𝑛𝑑 𝑑𝑖𝑎𝑚𝐷 𝐺 = 𝑐.
Case (iii)" 5 ≤ 𝑎 < 𝑏 = 𝑐. 𝐿𝑒𝑡 𝐸1 ∶ 𝑣1 , 𝑣2 , … , 𝑣𝑎+1 be a path of order 𝑎 + 1; 𝐸2 ∶
𝑤1 , 𝑤2 , … , 𝑤𝑏−𝑎+3 be another path of order 𝑏 − 𝑎 + 3 ; 𝑎𝑛𝑑 𝐸𝑖 (3 ≤ 𝑖 ≤ 𝑏 − 𝑎 + 2) 𝑏𝑒 𝑏 − 𝑎
copies of 𝐾1 . Let 𝐺 be the graph obtained from 𝐸𝑖 𝑓𝑜𝑟 𝑖 = 1, 2, … , 𝑏 − 𝑎 + 2 by identifying the vertices
𝑣𝑎−2 and 𝑣𝑎 of 𝐸1 with 𝑤1 and 𝑤𝑏−𝑎+3 of 𝐸2 , respectively, and joining each 𝐸𝑖 (3 ≤ 𝑖 ≤ 𝑏 − 𝑎 + 2)
with 𝑣𝑎−2 and 𝑤𝑖 . The graph 𝐺 is shown in Fig 1.5".

Fig 1.4. a.graph 𝑮 in Case(ii) of.Theorem(b).

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 67

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 09 | Sep 2023

Fig 1.5. a graph 𝑮 in Case(iii) of Theorem(b)

It is easily verified that 𝑒(𝑣) = 𝑎 if 𝑣 ∈ {𝑣1 , 𝑣𝑎+1 }; 𝑒(𝑣) ≤ 𝑎 𝑖𝑓 𝑣 ∈ 𝑉(𝐺) − {𝑣1 , 𝑣𝑎+1 }, 𝑎𝑛𝑑 𝑒𝑚 (𝑣) =
𝑏 𝑖𝑓 𝑣 ∈ {𝑣1 , 𝑣𝑎+1 }; 𝑒𝑚 (𝑣) ≤ 𝑏 𝑖𝑓 𝑣 ∈ 𝑉(𝐺) − {𝑣1 , 𝑣𝑎+1 }, 𝑎𝑛𝑑 𝑒𝐷 (𝑣) = 𝑐 𝑖𝑓 𝑣 ∈ {𝑣1 , 𝑣𝑎+1 }; and
𝑒𝐷 (v) ≤ c if 𝑣 ∈ 𝑉(𝐺) − {𝑣1 , 𝑣𝑎+1 }. It follows that 𝑟𝑎𝑑 𝐺 = 𝑎, 𝑟𝑎𝑑𝑚 𝐺 = 𝑏 and 𝑟𝑎𝑑𝐷 𝐺 = 𝑐. The
inequality 𝑟𝑎𝑑 𝐺 ≤ 𝑑𝑖𝑎𝑚 𝐺 ≤ 2 𝑟𝑎𝑑 𝐺 𝑎𝑛𝑑 𝑟𝑎𝑑𝐷 𝐺 ≤ 𝑑𝑖𝑎𝑚𝐷 𝐺 ≤ 2 𝑟𝑎𝑑𝐷 𝐺 hold for any connected
graph 𝐺. This is not applicable to monophonic radius and monophonic diameter, though. For instance, it is
clear that 𝑟𝑎𝑑𝑚 𝐺 = 1 and 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑝 − 3 ≥ 3 so that 𝑑𝑖𝑎𝑚𝑚 𝐺 > 2 𝑟𝑎𝑑𝑚 𝐺 when the.graph 𝐺 is
the wheel 𝑊1,𝑝−1 (𝑝 ≥ 6). that there is a connected graph 𝐺 with 𝑟𝑎𝑑 𝐺 = 𝑎 and 𝑑𝑖𝑎𝑚 𝐺 = 𝑏 If 𝑎 and 𝑏
are any two consecutive positive 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠, then 𝑎 ≤ 𝑏 ≤ 2𝑎. that there is a connected.graph 𝐺 with
𝑟𝑎𝑑𝐷 𝐺 = 𝑎 and 𝑑𝑖𝑎𝑚𝐷 𝐺 = 𝑏 If 𝑎 and 𝑏 are any two consecutive positive 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠, then 𝑎 ≤ 𝑏 ≤ 2𝑎.
The theorem that follows now provides a realization result for 𝑟𝑎𝑑𝑚 𝐺 𝑑𝑖𝑎𝑚𝑚 𝐺 .
1.8. Theorem. There exists a connected graph 𝐺 such that 𝑟𝑎𝑑𝑚 𝐺 = 𝑎 and 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑏 if 𝑎 𝑎𝑛𝑑 𝑏 are
positive integers with 𝑎 ≤ 𝑏 .
Proof. Three cases are used to demonstrate this result.
Case(i) 𝑎 = 𝑏 ≥ 1. Let 𝐺 be the.cycle 𝐶𝑎+2. Then 𝑟𝑎𝑑𝑚 𝐺 = 𝑎 and 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑏
Case (ii) 𝑎 < 𝑏 ≤ 2𝑎. 𝐿𝑒𝑡 𝐶1 ∶ 𝑢1 , 𝑢2 , … , 𝑢𝑎+2 , 𝑢1 be a cycle of order, and 𝐶2 : 𝑣1 , 𝑣2 , … , 𝑣𝑏−𝑎+2 , 𝑣1 be a
cycle of order, respectively. The graph that results from finding the vertex(es) 𝑢1 𝑜𝑓 𝐶1 𝑎𝑛𝑑 𝑣1 𝑜𝑓 𝐶2 is
denoted by 𝐺. Since 𝑏 ≤ 2𝑎, 𝑏 − 𝑎 + 2 ≤ 𝑎 + 2 follows naturally. It is obvious that for any
𝑥 𝑖𝑛 𝐺, 𝑑𝑚 (𝑢1 , 𝑥) = 𝑎 𝑎𝑛𝑑 𝑑𝑚 (𝑢1 , 𝑢𝑎+1 ) = 𝑎, and as a result, 𝑒𝑚 (𝑢1 ) = 𝑎. Furthermore, it is clear that
𝑟𝑎𝑑𝑚 𝐺 = 𝑎 because no vertex in 𝐺 has 𝑒𝑚 (𝑥) < 𝑎, and 𝑒𝑚 (𝑢3 ) = 𝑏 because it is clear that
𝑑𝑚 (𝑢3 , 𝑣3 ) = 𝑏 𝑎𝑛𝑑 𝑑𝑚 (𝑢3 , 𝑥) ≤ 𝑏. Additionally, it is clear that for each vertex 𝑥 𝑖𝑛 𝐺, 𝑒𝑚 (𝑥) ≤ 𝑏,
resulting in 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑏 .
Case (iii) 𝑏 > 2𝑎. Let 𝐺 stand for the graph formed by finding the end vertex of the path, 𝑃2𝑎 , and the
wheel's center vertex, 𝑊 = 𝐾1 + 𝐶𝑏+2 (𝑏 ≥ 2). Since 𝑏 > 2𝑎, each vertex of 𝑥 ∈ 𝑉(𝐶𝑏+2 ) because
𝑒𝑚 (𝑥) = 𝑏. Additionally, every vertex of 𝑥 ∈ 𝑉(𝑃2𝑎 ) 𝑎𝑛𝑑 𝑒𝑚 (𝑣𝑎 ) = 𝑎. As a result, 𝑟𝑎𝑑𝑚 𝐺 =
𝑎 𝑎𝑛𝑑 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑏 .
1.9.Remark. For 𝑖𝑛𝑡𝑒𝑔𝑒𝑟𝑠 𝑎 and 𝑏 with 2𝑎 < 𝑏, each vertex in the graph 𝐺 given in Fig 1.6. has
monophonic eccentricity b or 𝑛(𝑎 ≤ 𝑛 ≤ 2𝑎). So, unlike standard eccentricity, if 𝑘 is an integer such that
𝑟𝑎𝑑𝑚 𝐺 < 𝑘 < 𝑑𝑖𝑎𝑚𝑚 𝐺, there may not be a vertex 𝑥 of G such that 𝑒𝑚 (𝑥) = 𝑘.

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 68

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 09 | Sep 2023

Figure 1.6
2. Monophonic.center and. monophonic periphery
2.1. Definition. The monophonic center 𝐶𝑚 (𝐺) 𝑜𝑓 𝐺 is the subgraph that is generated by the G single-
note center vertices. If e_m (v) = rad_m G, a vertex v in a connected graph G is referred to as a monophonic
central vertex. The monophonic periphery is the subgraph that G monophonic peripheral vertices form.
𝑃𝑚 (𝐺)𝑜𝑓 𝐺. 𝐼𝑓 𝑒𝑚 (𝑣) = 𝑑𝑖𝑎𝑚𝑚 𝐺, a vertex 𝑣 𝑖𝑛 𝐺 is referred to as a monophonic peripheral vertex.
2.2.R emark. It is not necessary for a connected graph's monophonic center to be connected. 𝐶𝑚 (𝐺) =
{𝑣3 , 𝑣6 }. in relation to the graph 𝐺 in Figure 2.1.

Figure2.1. a.graph 𝑮 in.Remark

2.3. Theorem. Every.graph has a connected.monophonic.center.
Proof. 𝐺 should be a graph. We demonstrate how 𝐺 is a graph's monophonic center. Let the monophonic
diameter of 𝐺 be given 𝑏𝑦 𝑙 = 𝑑𝑚 . Let 𝑃 ∶ 𝑢1 , 𝑢2 , . . . , 𝑢𝑖 and 𝑄 ∶ 𝑣1 , 𝑣2 , … . . , 𝑣𝑖 be two copies of the path
𝑃𝑙. By connecting each vertex of graph 𝐺 with 𝑢1 𝑖𝑛 𝑃 𝑎𝑛𝑑 𝑣1 𝑖𝑛 𝑄, the necessary graph 𝐻 shown in Figure
2.2 is obtained from graphs 𝐺, 𝑃, 𝑎𝑛𝑑 𝑄. Then, for each vertex 𝑥 𝑖𝑛 𝐺, 𝑒𝑚𝐻 (𝑥) = 𝑑𝑚 , and for each vertex 𝑥
outside of 𝐺, 𝑑𝑚 + 1 ≤ 𝑒𝑚𝐻 (𝑥) ≤ 2 𝑑𝑚 . 𝐶𝑚 (𝐻) = 𝐺 because 𝑉(𝐺) is the collection of monophonic
central vertices of 𝐻.
2.4. Theorem. Every connected graph's monophonic center 𝐶𝑚 (𝐺). Some block of 𝐺 is a subgraphs of 𝐺.
Proof. Assume a connected graph 𝐺 exists with a monophonic center 𝐶𝑚 (𝐺) that is not a subparagraph of a
𝐺 block.. Afterward, 𝐺 has a cut vertex 𝑣. resulting in 𝐺 − 𝑣 having two components, 𝐻1 and 𝐻2 , each with
𝐶𝑚 (𝐺) vertices. Let 𝑢 be a 𝐺 vertex such that 𝑒𝑚 (𝑣) = 𝑑𝑚 (𝑢, 𝑣), and 𝑃1 be the longest 𝑢 − 𝑣 monophonic
path in 𝐺. Consequently, at least one of 𝐻1 and 𝐻2 lacks 𝑃1 vertices, for example, 𝐻2 . Now consider a vertex

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 69

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 09 | Sep 2023

𝑤 in 𝐶𝑚 (𝐺) that belongs to 𝐻2 , and consider 𝑃2 to be the longest 𝑣 − 𝑤 monophonic path in 𝐺 .𝑃1 followed
by 𝑃2 yields the 𝑢 − 𝑤 longest.monophonic path with a length.greater than 𝑃1 because v is a cut vertex. This
results in 𝑒𝑚 (𝑤) > 𝑒𝑚 (𝑣), implying the contradiction that 𝑤 is not the monophonic central vertex of 𝐺.
2.5.Problem. Considering any three positive integers a, b, and 𝑐 𝑤𝑖𝑡ℎ 1 ≤ 𝑎 ≤ 𝑏 ≤ 𝑐 whether a
connected graph 𝐺 exists 𝑑𝑖𝑎𝑚 𝐺 = 𝑎, 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑏 𝑎𝑛𝑑 𝑑𝑖𝑎𝑚𝐷 𝐺 = 𝑐?

Figure 2.2
Solution: We consider the following four instances.
Case 1. 𝑎 = 1 If such a graph exists, 𝐺 is a complete graph of order 𝑐 + 1 for some 𝑐 ≥ 1 because diam
𝐺 = 1. Therefore, 1 = 𝑎 = 𝑏 ≤ 𝑐 and 𝑏 = 𝑑𝑖𝑎𝑚𝑚 𝐺 = 1 and 𝑑𝑖𝑎𝑚𝐷 𝐺 = 𝑐. For some 𝑐 ≥ 1,
however, 𝐺 is a complete graph of order 𝑐 + 1 if 𝑎 = 𝑏 = 1. As a result, if and only if 1 = 𝑎 = 𝑏 ≤ 𝑐,
there is a graph 𝐺 with diam 𝐺 = 𝑎 = 1, 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑏, 𝑎𝑛𝑑 𝑑𝑖𝑎𝑚𝐷 𝐺 = 𝑐.
Case 2. 𝑎 = 𝑏 = 𝑐 .
A desired graph is one with a path of order 𝑐 + 1. (In reality, 𝑑𝑖𝑎𝑚 𝑇 = 𝑑𝑖𝑎𝑚𝑚 𝑇 = 𝑑𝑖𝑎𝑚𝐷 𝑇 is a tree 𝑇
property.)
Case 3. 2 ≤ 𝑎 ≤ 𝑏 < 𝑐.
Let a path lead to the graph 𝐺, 𝑃 ∶ 𝑢0 , 𝑢1 , 𝑢2 , . . . , 𝑢𝐶 by joining the vertices 𝑢𝑐 and 𝑢𝑡 𝑓𝑜𝑟 𝑎 − 2 ≤ 𝑡 < 𝑐,
and 𝑢𝑖 and 𝑢𝑗 for 𝑏 − 1 ≤ 𝑖 < 𝑗 ≤ 𝑐 (avoiding the multiple edges formed during the construction). It is
routine to check that 𝑑𝑖𝑎𝑚 𝐺 = 𝑎, 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑏, 𝑎𝑛𝑑 𝑑𝑖𝑎𝑚𝐷 𝐺 = 𝑐.
Case 4. 2 ≤ 𝑎 < 𝑏 = 𝑐
First, suppose 2 ≤ 𝑎 ≤ 3. Let 𝑃 ∶ 𝑢0 , 𝑢1 , 𝑢2 , . . . , 𝑢𝐶 be a monophonic path of length 𝑐. Since 𝑎 < 𝑐, 𝑃 is
not a 𝑢0 − 𝑢𝑐 geodesic. Let 𝑄 ∶ 𝑢0 , 𝑣1 , 𝑣2 , . . . , 𝑣𝑘 , uc be a 𝑢0 − 𝑢𝑐 geodesic. Since 𝑃 is monophonic, 𝑣1 =
𝑢𝑖 for 2 ≤ 𝑖 ≤ 𝑐. Moreover 𝑣1 = 𝑢1 . Otherwise, 𝑃1 ∶ 𝑣1 , 𝑢0 , 𝑢1 , 𝑢2 , . . . , 𝑢𝑐 is a path of length 𝑐 + 1,
which is a contradiction. Similarly, we have 𝑣𝑘 = 𝑢𝑐−1 . By the same argument as above, we may assume
that 𝑣𝑖 = 𝑢𝑖 for 1 ≤ 𝑖 ≤ 𝑠 𝑜𝑟 𝑡 ≤ 𝑖 ≤ 𝑐 − 1, where 𝑠 < 𝑡 and 𝑣𝑗 = 𝑢𝑗 for 𝑗 = 𝑠 + 1 𝑜𝑟 𝑡 − 1.
Hence, 𝑑(𝑢0 , 𝑢𝑐 ) ≥ 4 ≥ 𝑎 + 1, which is a contradiction. Therefore, no such graphs exist in this subcase
Let's say that's 𝑎 ≥ 4 now. We can create the graph 𝐺 from the path 𝑃: 𝑢0 , 𝑢1 , 𝑢2 , . . . 𝑢𝑐 by adding a new
vertex 𝑣 and connecting it to the vertices 𝑢𝑐−𝑎+3 𝑎𝑛𝑑 𝑢2𝑖−1 𝑓𝑜𝑟 1 ≤ 2𝑖 − 1 < 𝑐 − 𝑎 + 2. Verifying that
𝑑𝑖𝑎𝑚 𝐺 = 𝑎, 𝑑𝑖𝑎𝑚𝑚 𝐺 = 𝑏, and 𝑑𝑖𝑎𝑚𝐷 𝐺 = 𝑐 is routine.
2.6. Theorem. "A non-trivial graph 𝐺 is the monophonic periphery of some con nected graph if and only
if every vertex of 𝐺 has monophonic eccentricity 1 or no vertex of 𝐺 has monophonic eccentricity 1".
Proof. "Suppose that every vertex of 𝐺 has monophonic eccentricity 1. Then 𝑃𝑚 (𝐺) = 𝐺. Next, suppose
that no vertex of 𝐺 has monophonic eccentricity 1. Hence for any vertex 𝑥 in 𝐺, there is a vertex 𝑦 in 𝐺 such
that 𝑒𝑚 (𝑥) = 𝑑𝑚 (𝑥, 𝑦) ≥ 2.
Clearly, 𝑒𝑚 (𝑥) ≤ 𝑝 − 1. Now, take 𝑝 vertex disjoint paths 𝑃𝑖 (1 ≤ 𝑖 ≤ 𝑝) each of length 𝑝 − 1 𝑠uch
that no vertex of 𝑃𝑖 is a vertex of 𝐺. Identify the end vertices of one path, say 𝑃𝑖 , with 𝑥 𝑎𝑛𝑑 𝑦, thereby
producing a cycle of length 𝑒𝑚 (𝑥) + 𝑝 – 1 This is done for every vertex 𝑧 = 𝑥 𝑜𝑓 𝐺 by taking a

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 70

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 09 | Sep 2023

path 𝑃𝑗 (𝑖 = 𝑗). Let the graph obtained be 𝐺1 . Now, for every path 𝑃𝑖 (1 ≤ 𝑖 ≤ 𝑝) in 𝐺1 , join each internal
vertex of 𝑃𝑖 with every vertex of 𝑉 (𝐺1 ) − 𝑉 (𝑃𝑖 ), avoiding multiple edges. Let 𝐻 be the resulting graph
obtained. (It is to be noted that if 𝑦 is a monophonic eccentric vertex of 𝑥, then 𝑥 is also a monophonic
eccentric vertex of 𝑦, and adjoining a path as mentioned above, may or may not be done. This does not affect
the monophonic eccentricity of any vertex in 𝐻.) Let 𝑒𝑚 𝐻(𝑣) denote the monophonic eccentricity of a
vertex 𝑣 𝑖𝑛 𝐻. Then it is clear that 𝑒𝑚 𝐻(𝑣) = 𝑝 − 1 for any vertex 𝑣 𝑖𝑛 𝐺 and 𝑒𝑚 𝐻(𝑣) ≤ 𝑝 − 2 for any
vertex 𝑣 not in 𝐺. Hence 𝑃𝑚 (𝐻) = 𝐺. The graph in Fig. 9 shows the construction of the graph 𝐻 when 𝐺 is
the path 𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 , where 𝑒𝑚 𝐻(𝑣) = 3 for every vertex 𝑣 𝑖𝑛 𝐺 and 𝑒𝑚 𝐻(𝑣) = 2 for every vertex
𝑣 𝑛𝑜𝑡 𝑖𝑛 𝐺.
Conversely, let 𝐺 = 𝑃𝑚 (𝐻). Suppose that some but not all vertices of 𝐺 have monophonic eccentricity 1.
Certainly 𝐺 is a proper subgraph of 𝐻. Therefore, for each vertex 𝑥 𝑜𝑓 𝐺, it follows that 𝑒𝑚 𝐻(𝑥) =
𝑑𝑖𝑎𝑚𝑚 𝐻 ≥ 2. Let 𝑢 be a vertex of 𝐺 having monophonic eccentricity 1 𝑖𝑛 𝐺. Then, 𝑢 is adjacent to all
other vertices of 𝐺. Let 𝑣 be a vertex of 𝐻 such that 𝑑𝑚 𝐻(𝑢, 𝑣) = 𝑒𝑚 𝐻(𝑢) = 𝑑𝑖𝑎𝑚𝑚 𝐻 ≥ 2.
Hence 𝑒𝑚 𝐻(𝑣) = 𝑑𝑖𝑎𝑚𝑚 𝐻 and so 𝑣 ∈ 𝑃𝑚 (𝐻) = 𝐺. Hence 𝑢 𝑎𝑛𝑑 𝑣 are adjacent in 𝐺 and so
𝑢 𝑎𝑛𝑑 𝑣 𝑎re also adjacent in 𝐻 so that 𝑑𝑚 𝐻(𝑢, 𝑣) = 1, which is a contradiction".
2.7. Definition. If 𝑟𝑎𝑑𝑚 𝐺 = 𝑑𝑖𝑎𝑚𝑚 𝐺, or if 𝐺 is its own monophonic center, a connected graph 𝐺 is
monophonic and self-centered .
3. Monophonic number of a graph
3.1. Definition. If each vertex 𝑣 of a graph 𝐺 lies on an 𝑥 − 𝑦 monophonic path in 𝐺 for some 𝑥, 𝑦 ∈ 𝑆,
then the set 𝑆 of its vertices is said to be a monophonic set of 𝐺. The monophonic number is the minimum
cardinality of a monophonic set of 𝐺.
and is indicated by of 𝐺. 𝑚(𝐺).
3.2. Example. The minimum monophonic sets of the graph 𝐺 shown in Figure 3.1 are 𝑆1 = {𝑥, 𝑤} and
𝑆2 = {𝑢, 𝑤}, and as a result, 𝑚(𝐺) = 2.
𝑋 𝑦

𝑢 𝑣

Figure 2.3.1 . A graph 𝑮 with 𝒎(𝑮) = 𝟐

If a vertex 𝑣 in a graph 𝐺 is a member of each minimal monophonic set in 𝐺, then it is a monophonic vertex.
Every vertex in 𝑆 is a monophonic vertex if 𝐺 has a singular minimal monophonic set 𝑆. In the following
theorem, we demonstrate that a nontrivial linked graph 𝐺 has certain vertices that are monophonic 𝐺
vertices.
3.3. Theorem Every extreme vertex of a connected graph 𝐺 is contained in every monophonic set of the
graph... Additionally, 𝑆 is the specific minimum monophonic set of 𝐺 if the set S of all extreme vertices of 𝐺
is a monophonic set.
Proof. Let 𝑆 be a monophonic set of 𝐺 and let u be an extreme vertex. Assume that 𝑢 ∈ 𝑆 Then, for some
𝑥, 𝑦 ∈ 𝑆, 𝑢 is an internal vertex of a 𝑥 − 𝑦 monophonic path, let say 𝑃. Allow 𝑣 and 𝑤 to be 𝑢 's neighbors
on 𝑃. This results in a contradiction because 𝑣 and 𝑤 are not contiguous and 𝑢 is not an extreme vertex.
Consequently, 𝑢 is a member of every monophonic set of 𝐺.

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 71

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 09 | Sep 2023

3.4. Corollary. For complete graph 𝐾𝑝 (𝑝 ≥ 2), 𝑚(𝐾𝑝 ) = 𝑝.

3.5. Theorem .Let 𝑆 be a monophonic set of 𝐺 and let 𝐺 be a connected graph with a cutvertex named 𝑣.
Then, an element of 𝑆 is contained in each component of 𝐺 − 𝑣.
Proof. Consider a component 𝐵 of 𝐺 − 𝑣 which does not contain any vertex of 𝑆. Let any vertex in 𝐵 be
you. Due to the fact that 𝑆 is a monophonic set, there is a pair of vertices 𝑥 and 𝑦 in 𝑆 such that 𝑢 lies in
some 𝑥 − 𝑦 monophonic path 𝑃: 𝑥 = 𝑢0 , 𝑢1 , 𝑢2 , . . . , 𝑢, . . . , 𝑢𝑛 = 𝑦 in 𝐺 with 𝑢 ≠ 𝑥, 𝑦. 𝑉 being a
cutvertex of Both the 𝑢 − 𝑦 subpath 𝑃2 of 𝑃 and the 𝑥 − 𝑢 subpath 𝑃1 of 𝑃 contain 𝑣, it. Hence, which is a
contradiction, 𝑃 is not a path.
3.6. Theorem .A connected graph 𝐺 cutvertex does not belong to any minimum monophonic set of 𝐺.
Proof. Let 𝑆 be the minimum monophonic set of 𝐺 and let 𝑣 be a cutvertex of 𝐺. Theorem 2.5 states that
every part of 𝐺 − 𝑣 contains a part of 𝑆. Let 𝑈 and 𝑊 be two separate parts of 𝐺 − 𝑣, where 𝑢 ∈ 𝑈 and
𝑤 ∈ 𝑊. Following that, 𝑣 is an internal vertex of a monophonic path 𝑢– 𝑤. Let 𝑆′ = 𝑆 − {𝑣}. Every vertex
that is located on an 𝑢 − 𝑣 monophonic path is evidently also Every vertex that is located on an 𝑢 − 𝑣
monophonic path is evidently also monophonic set of 𝐺, which is in contrast to the statement that 𝑆 is a
minimum monophonic set of 𝐺.
3.7. Theorem .If 𝐺 is a connected non-complete graph with a minimum cutset of vertices, then 𝑚(𝐺) ≤
𝑝−𝑘
Proof. 𝐺 is an non-complete connected graph, hence it is obvious that 1 ≤ 𝑘 ≤ 𝑝 − 2. Let 𝑈 be the
minimum cutset of 𝐺, where 𝑈 = {𝑢1 , 𝑢2 , 𝑢3 , . . . , 𝑢𝑘 }. Let 𝑆 = 𝑉 − 𝑈 and 𝐺1 , 𝐺2 , . . . , 𝐺𝑟 , (𝑟 ≥ 2) be the
parts of 𝐺 − 𝑈. Then, for each 𝑗 (1 ≤ 𝑗 ≤ 𝑟), every vertex 𝑢𝑖 (1 ≤ 𝑖 ≤ 𝑘) is close to at least one vertex of
𝐺𝑗 . Since 𝑆 is obviously a monophonic set of 𝐺, 𝑚(𝐺) ≤ |𝑆| = 𝑝 − 𝑘.
3.8. Remark. Theorem 2.3.7 has a sharp bound. For the cycle 𝐶4 , 𝑚(𝐶4 ) = 2. Also 𝜅 = 2 and 𝑝 −
𝜅 = 2. Thus 𝑚(𝐺) = 𝑝 − 𝜅
3.9. Theorem : 𝐺 is complete If and only if 𝑚(𝐺) = 𝑝, for any connected.graph 𝐺 of order 𝑝
Proof. Suppose 𝑚(𝐺) = 𝑝. Assume that 𝐺 is not.a fully complete graph. Then.there are two.vertices
𝑢 𝑎𝑛𝑑 𝑣 that are such that they are not next to one another in 𝐺. 𝐺 is connected, hence there is a monophonic
path with length at least 2 from 𝑢 to 𝑣, let 𝑥 say 𝑃. In order for 𝑥 ≠ 𝑢, 𝑣, it must be a vertex of 𝑃. Therefore,
𝑚(𝐺) ≤ 𝑝 − 1 is incongruent since 𝑆 = 𝑉 − { 𝑥} is a monophonic set of 𝐺.
3.10. Definition : Choose any vertex in 𝐺 to represent 𝑥. If any vertex 𝑧 with 𝑑𝑚 (𝑥, 𝑦) < 𝑑𝑚 (𝑥, 𝑧), 𝑧 lies
on an 𝑥 − 𝑦 monophonic path, then vertex 𝑦 in 𝐺 is said to be an 𝑥 − monophonic superior vertex.
3.11. Theorem. Let 𝑥 represent any 𝐺 vertex. Then, each 𝑥 - monophonic superior vertex is a monophonic
eccentric vertex of 𝑥.
Proof. So that 𝑒𝑚 (𝑥) = 𝑑𝑚 (𝑥, 𝑦), let 𝑦 be a monophonic eccentric vertex of 𝑥. There exists a vertex 𝑧 in 𝐺
such that 𝑑𝑚 (𝑥, 𝑦) < 𝑑𝑚 (𝑥, 𝑧) and 𝑧 does not reside on any 𝑥 − 𝑦 monophonic path, leading to the
contradiction that 𝑒𝑚 (𝑥) ≥ 𝑑𝑚 (𝑥, 𝑧) > 𝑑𝑚 (𝑥, 𝑦), which occurs if 𝑦 is not an 𝑥 - monophonic superior
vertex.
3.12. Note .Theorem 3.11 converse is untrue. The cycle 𝐶6 has the following vertices:
𝑣1 , 𝑣2 , 𝑣3 , 𝑣4 , 𝑣5 , 𝑣6 , 𝑣1 , where 𝑣4 is a 𝑣1 - monophonic superior vertices and not a 𝑣1 - monophonic eccentric
vertices.
3.13. Theorem .Supposing 𝐺 is a connected graph, If and only if two vertices 𝑥 and 𝑦 exist, with 𝑦 being
an 𝑥-monophonic superior vertex and every vertex of 𝐺 being on an 𝑥 − 𝑦 monophonic path, then 𝑚(𝐺) =
2.

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 72

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 09 | Sep 2023

Proof.Assume that 𝑆 = {𝑥, 𝑦} is a minimum monophonic set of 𝐺 and that 𝑚(𝐺) = 2. There is a vertex
𝑧 in 𝐺 with 𝑑𝑚 (𝑥, 𝑦) < 𝑑𝑚 (𝑥, 𝑧) and 𝑧 does not reside on any 𝑥 − 𝑦 monophonic path if y is not an 𝑥-
monophonic superior vertex. This results in a contradiction because 𝑆 is not a monophonic set of 𝐺.
4. Bounds for the monophonic number of a graph
We provide an improved upper bound for the monophonic number of a graph in the following theorem in
terms of its order and monophonic diameter. We use the term "𝑑𝑚 " to represent the monoponic diameter
diammG for convenience.
4.1. Theorem .𝑚(𝐺) ≤ 𝑝 − 𝑑𝑚 + 1 if 𝐺 is a non-trivial connected graph with order 𝑝 and monophonic
diameter 𝑑𝑚 .
Proof .Let 𝑃: 𝑢 = 𝑣0 , 𝑣1 , . . . , 𝑣𝑑𝑚 = 𝑣 be an 𝑢 − 𝑣 monophonic path of length 𝑑𝑚 . Let 𝑢 and 𝑣 be the
vertices of 𝐺 such that 𝑑𝑚 (𝑢, 𝑣) = 𝑑𝑚 . Let 𝑆 = 𝑉 − { 𝑣1 , 𝑣2 , . . . , 𝑣𝑑𝑚 − 1}. When 𝑚(𝐺) ≤ |𝑆| = 𝑝 −
𝑑𝑚 + 1, it is evident that 𝑆 is a monophonic set of 𝐺. In order to ensure that the bound in Theorem 2.4.1 is
sharp, for the complete graph 𝐾𝑝 (𝑝 ≥ 2), 𝑑𝑚 = 1 and 𝑚(𝐾𝑝 ) = 𝑝.
4.2. Theorem. 2 ≤ 𝑚(𝐺) ≤ 𝑔(𝐺) ≤ 𝑝 for each connected graph 𝐺 of order 𝑝.
Proof. Every geodesic is a monophonic path, hence every geodetic set must also be a monophonic set.
Consequently, 𝑚(𝐺) ≤ 𝑔 (𝐺). The other disparities are trivial.
4.3. Remark 3.1.Theorem 4.2 bounds are exact. Assuming that 𝐾𝑝 is a complete graph, 𝑚(𝐾𝑝 ) =
𝑔(𝐾𝑝 ) = 𝑝. 𝑚(𝑃𝑛 ) = 𝑔(𝑃𝑛 ) = 2 for the path 𝑃𝑛 , which is non-trivial. Additionally, 𝑚(𝐺) = 𝑔 (𝐺) is a
complete bipartite graph, an even cycle, or a non-trivial tree (𝐺). In Theorem 4.2, every inequality is a
rigorous inequality. 𝑆 = {𝑣6 , 𝑣7 , 𝑣3 } is a minimum monophonic set of the graph 𝐺 shown in Figure 4.1 such
that 𝑚(𝐺) = 3 and no 3-elements subset of the vertex set is a geodetic set of 𝐺. A geodetic set of 𝐺 is 𝑆 ∪
{ 𝑣1}, hence it follows that 𝑔(𝐺) = 4. As a result, we have 2 < 𝑚(𝐺) < 𝑔(𝐺) < 𝑝.

Figure 4.1. A graph 𝑮 in Remark 4.3. with 𝟐 < 𝒎(𝑮) < 𝒈(𝑮) < 𝒑
𝐑𝐞𝐟𝐞𝐫𝐞𝐧𝐜𝐞𝐬
1. A. P. Santhakumaran and P. Titus, A Note on “Monophonic Distance in Graphs”, Discrete Mathematics,
Algorithms and Applications, Vol. 4, No. 2 (2012).
2. Azimi, A., & Ghouchan, M. F. D. (2014). Simple graphs whose 2-distance graphs are path or cycle. Le
Matematiche, 69(2), 183-191.
3. Chartrand G, Escuadro H, Zhang P. Detour distance in graphs. Journal of Combinatorial Mathematics
and Combinatorial Computing. 2005; 53:75-94.
4. Chartrand G, Zhang P. Distance in graphs – Taking the long view. AKCE International Journal of
Graphs and Combinatorics. 2004;1(1):1-13.

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 73

CENTRAL ASIAN JOURNAL OF MATHEMATICAL THEORY AND COMPUTER SCIENCES Vol: 04 Issue: 09 | Sep 2023

5. Delorme, C. Distance biregular bipartite graphs. European Journal of Combinatorics 15, 3 (1994), 223 –
238.
6. Fiol, M. Algebraic characterizations of bipartite distance-regular graphs. In 3rd International Workshop
on Optimal Networks Topologies, IWONT.
7. Fiol, M., and Garriga, E. From local adjacency polynomials to locally pseudo-distance-regular graphs.
Journal of Combinatorial Theory, Series B 71, 2 (1997), 162–183.
8. Fiol, M., Garriga, E., and Yebra, J. Locally pseudo-distanceregular graphs. Journal of Combinatorial
Theory, Series B 68, 2 (1996), 179–205.
9. Goddard, W., & Oellermann, O. R. (2011). Distance in graphs. In Structural Analysis of Complex
Networks (pp. 49-72). Birkhäuser Boston.
10. Goddard, W., Swart, C. S., & Swart, H. C. (2005). On the graphs with maximum distance or $ k $-
diameter. Mathematica Slovaca, 55(2), 131-139.
11. Godsil, C., and Shawe-Taylor, J. Distance-regularised graphs are distance-regular or distance-biregular.
Journal of Combinatorial Theory, Series B 43, 1 (1987), 14 – 24.
12. M. C. Dourado, F. Protti and J.L. Szwarcfiter, Algorithmic Aspects of Monophonic Convexity,
Electronic Notes in Discrete Mathematics, 30 (2008) 177-182.
13. P. Titus, K. Ganesamoorthy and P. Balakrishnan, The Detour Monophonic Number of a Graph, J.
Combin. Math. Combin. Comput., 84, pp. 179-188, (2013).
14. R. B. Eggleton, P. Erd¨os and D. K. Skilton, Colouring the real line, J. Combin. Theory, Ser. B, 39(1)
(1985), 86–100.
15. Santhakumaran AP, Titus P. Monophonic distance in graphs. Discrete Mathematics, Algorithms and
Applications. 2011; 3(2):159-169.
16. Santhakumaran AP, Titus P. The geo-number of a graph. Ars Combinatoria. 2012;106: 65-78.
17. Santhakumaran AP, Titus P. The vertex detour number of a graph. AKCE International Journal of
Graphs and Combinatorics. 2007;4(1):99-112.
18. Titus P, Balakrishnan P. The forcing vertex detour monophonic number of a graph. AKCE International
Journal of Graphs and Combinatorics. 2016; DOI: 10.1016/j. akcej.2016.03.002.
19. Titus P, Ganesamoorthy K. Upper edge detour monophonic number of a graph. Proyecciones Journal of
Mathematics. 2014;33(2):175-187.
20. Titus, P., & Santhakumaran, A. P. (2017). Monophonic Distance in Graphs. In Graph Theory-Advanced
Algorithms and Applications. Intech Open.

© 2023, CAJMTCS | CENTRAL ASIAN STUDIES www.centralasianstudies.org ISSN: 2660-5309 | 74