On Restricted Detour Median of Special Graphs

Rasha S. Hasan, Haitham N. Mohammed and Ahmed M. Ali

International Journal of Mathematics and Mathematical Sciences, 2025, vol. 2025, 1-9

Abstract: The restricted detour distance between two vertices is the length of longest path P such that the induced subgraph for a vertex set of P is identical P. The number of restricted detour distance of a vertex v of a connected graph Ǥ is a summation of restricted detour distances from v to all vertices of Ǥ. In this paper, we give a new definitions called restricted detour median graph (RDM-graph) and restricted detour self-median graph (RDSM-graph) and then we find many results related with them.

Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/ijmms/2025/3352309.pdf (application/pdf)
http://downloads.hindawi.com/journals/ijmms/2025/3352309.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:3352309

DOI: 10.1155/ijmm/3352309

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().