ON MONOPHONIC ECCENTRIC SEQUENCES OF GRAPHS
Abstract
For a connected graph $G$ and a vertex $v \in V(G)$, the eccentricity $e(v)$ is the maximum distance from $v$ to any other vertex in $G$. A path $P$ in $G$ is called a monophonic path if it is chordless. The monophonic distance $d_m(u,v)$ between two vertices $u$ and $v$ is the length of a longest chordless $u$--$v$ path in $G$. The monophonic eccentricity of a vertex $v$, denoted by $e_m(v)$, is defined as the maximum monophonic distance between $v$ and any other vertex of $G$. In this paper, we investigate monophonic eccentric sequences for several classes of graphs. In particular, we determine these sequences for unicyclic graphs and the Petersen graph, and obtain characterizations related to monophonic eccentricities in these graph classes.
Keywords
References
- [1] Lesniak, L., (1975), Eccentric sequences in graphs, Periodica Mathematica Hungarica, 6(4), pp. 287– 293.
- [2] Buckley, F., Harary, F., (1990), Distance in graphs, Addison-Wesley, Redwood City.
- [3] West, D. B., et al., (2001), Introduction to graph theory, Prentice Hall, Upper Saddle River.
- [4] Dourado, M. C., et al., (2008), Algorithmic aspects of monophonic convexity, Electronic Notes in Discrete Mathematics, 30, pp. 177–182.
- [5] Santhakumaran, A., Titus, P., (2011), Monophonic distance in graphs, Discrete Mathematics, Algorithms and Applications, 3(2), pp. 159–169.
- [6] Santhakumaran, A., et al., (2014), On the monophonic number of a graph, Journal of Applied Mathematics and Informatics, 32(1–2), pp. 255–266.
- [7] Titus, P., et al., (2016), On the detour monophonic number of a graph, Ars Combinatoria, 129, pp. 33–42.
- [8] Titus, P., Ganesamoorthy, K., (2016), Upper detour monophonic number of a graph, Electronic Notes in Discrete Mathematics, 53, pp. 331–342.
Details
Primary Language
English
Subjects
Combinatorics and Discrete Mathematics (Excl. Physical Combinatorics)
Journal Section
Research Article
Authors
Publication Date
November 5, 2026
Submission Date
August 2, 2025
Acceptance Date
July 1, 2026
Published in Issue
Year 2026 Volume: 16 Number: 11
APA
Jaji, D., Paradesi, T. R., & Deepika, H. R. (2026). ON MONOPHONIC ECCENTRIC SEQUENCES OF GRAPHS. TWMS Journal of Applied and Engineering Mathematics, 16(11), 1337-1345. https://izlik.org/JA22EX82UJ
AMA
1.Jaji D, Paradesi TR, Deepika HR. ON MONOPHONIC ECCENTRIC SEQUENCES OF GRAPHS. JAEM. 2026;16(11):1337-1345. https://izlik.org/JA22EX82UJ
Chicago
Jaji, Diya, Tabitha Rajashekar Paradesi, and H R Deepika. 2026. “ON MONOPHONIC ECCENTRIC SEQUENCES OF GRAPHS”. TWMS Journal of Applied and Engineering Mathematics 16 (11): 1337-45. https://izlik.org/JA22EX82UJ.
EndNote
Jaji D, Paradesi TR, Deepika HR (November 5, 2026) ON MONOPHONIC ECCENTRIC SEQUENCES OF GRAPHS. TWMS Journal of Applied and Engineering Mathematics 16 11 1337–1345.
IEEE
[1]D. Jaji, T. R. Paradesi, and H. R. Deepika, “ON MONOPHONIC ECCENTRIC SEQUENCES OF GRAPHS”, JAEM, vol. 16, no. 11, pp. 1337–1345, Nov. 2026, [Online]. Available: https://izlik.org/JA22EX82UJ
ISNAD
Jaji, Diya - Paradesi, Tabitha Rajashekar - Deepika, H R. “ON MONOPHONIC ECCENTRIC SEQUENCES OF GRAPHS”. TWMS Journal of Applied and Engineering Mathematics 16/11 (November 5, 2026): 1337-1345. https://izlik.org/JA22EX82UJ.
JAMA
1.Jaji D, Paradesi TR, Deepika HR. ON MONOPHONIC ECCENTRIC SEQUENCES OF GRAPHS. JAEM. 2026;16:1337–1345.
MLA
Jaji, Diya, et al. “ON MONOPHONIC ECCENTRIC SEQUENCES OF GRAPHS”. TWMS Journal of Applied and Engineering Mathematics, vol. 16, no. 11, Nov. 2026, pp. 1337-45, https://izlik.org/JA22EX82UJ.
Vancouver
1.Diya Jaji, Tabitha Rajashekar Paradesi, H R Deepika. ON MONOPHONIC ECCENTRIC SEQUENCES OF GRAPHS. JAEM [Internet]. 2026 Nov. 5;16(11):1337-45. Available from: https://izlik.org/JA22EX82UJ