On Restricted Detour Median of Special Graphs
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2025-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/ijmm/3352309 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1687-0425 |