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!
|
| _version_ | 1849707276117475328 |
|---|---|
| author | Rasha S. Hasan Haitham N. Mohammed Ahmed M. Ali |
| author_facet | Rasha S. Hasan Haitham N. Mohammed Ahmed M. Ali |
| author_sort | Rasha S. Hasan |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-e13f6fdee2ff434b87763db3a3c7f7e8 |
| institution | DOAJ |
| issn | 1687-0425 |
| language | English |
| publishDate | 2025-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Mathematics and Mathematical Sciences |
| spelling | doaj-art-e13f6fdee2ff434b87763db3a3c7f7e82025-08-20T03:15:57ZengWileyInternational Journal of Mathematics and Mathematical Sciences1687-04252025-01-01202510.1155/ijmm/3352309On Restricted Detour Median of Special GraphsRasha S. Hasan0Haitham N. Mohammed1Ahmed M. Ali2Department of MathematicsAl-Haram First Primary SchoolDepartment of MathematicsThe 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.http://dx.doi.org/10.1155/ijmm/3352309 |
| spellingShingle | Rasha S. Hasan Haitham N. Mohammed Ahmed M. Ali On Restricted Detour Median of Special Graphs International Journal of Mathematics and Mathematical Sciences |
| title | On Restricted Detour Median of Special Graphs |
| title_full | On Restricted Detour Median of Special Graphs |
| title_fullStr | On Restricted Detour Median of Special Graphs |
| title_full_unstemmed | On Restricted Detour Median of Special Graphs |
| title_short | On Restricted Detour Median of Special Graphs |
| title_sort | on restricted detour median of special graphs |
| url | http://dx.doi.org/10.1155/ijmm/3352309 |
| work_keys_str_mv | AT rashashasan onrestricteddetourmedianofspecialgraphs AT haithamnmohammed onrestricteddetourmedianofspecialgraphs AT ahmedmali onrestricteddetourmedianofspecialgraphs |