Monophonic-triangular Distance in Graphs
DOI:
https://doi.org/10.22199/issn.0717-6279-5805Keywords:
distance, detour distance, monophonic distance, mt-distance, mt-radius, mt-diameter, mt-centerAbstract
A path u1, u2, ..., un in a connected graph G such that for i, j with j ≥ i + 3, there does not exist an edge uiuj , is called a monophonic-triangular path or mt-path. The monophonic-triangular distance or mt-distance dmt(u, v) from u to v is defined as the length of a longest u−v mt-path in G. The mt-eccentricity emt(v) of a vertex v in G is defined as the maximum mt-distance between v and other vertices in G. The mt-radius radmt(G) is defined as the minimum mt-eccentricity among the vertices of G and the mt-diameter diammt(G) is defined as the maximum mt-eccentricity among the vertices of G. It is shown that radmt(G) ≤ diammt(G) for every connected graph G. Some realization and characterization results are given based on mt-radius, mt-diameter, mt-center and mt-periphery of a connected graph.
References
F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, Redwood city, CA, 1990.
G. Chartrand, H. Escuadro and P. Zhang, Detour Distance in Graphs, J.Combin. Math. Combin. Comput., 53 (2005), 75-94.
F. Harary, Graph Theory, Addison-Wesley, 1969.
P.A. Ostrand, Graphs with Specified Radius and Diameter, Discrete Mathematics, 4 (1973), 71-75.
A.P. Santhakumaran and P. Titus, Monophonic Distance in Graphs, Discrete Mathematics, Algorithms and Applications, Vol. 3, No. 2 (2011), 159-169.
A.P. Santhakumaran and P. Titus, A Note on “Monophonic Distance in Graphs”, Discrete Mathematics, Algorithms and Applications, Vol. 4, No. 2 (2012), DOI: 10.1142 / s1793830912500188.
Published
How to Cite
Issue
Section
Copyright (c) 2024 P.Ttius P.
This work is licensed under a Creative Commons Attribution 4.0 International License.
-
Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.