|
|
 |
| |
|
|
|
Detour Saturated Graph |
|
|
|
PP: 269-272 |
|
|
|
Author(s) |
|
|
|
Ali Aziz Ali,
Gashaw Aziz Mohammed-Saleh,
|
|
|
|
Abstract |
|
|
| A connected graph G of order p is detour saturated if and only if the detour distance between every two distinct vertices in
G is p−1. The detour saturated graphs of order p and of minimum density are characterized in this paper. Also, detour saturated graphs
are obtained from two disjoint connected graphs by using joint and Cartesian product operations. |
|
|
|
|
|
|
|
