Published September 23, 2023
| Version v1
Journal article
Open
Domination edge connectivity of graphs
- 1. Van Yüzüncü Yıl University
- 2. Bingöl University
Description
Domination and connectivity are two independent subjects of graph theory which have many applications in computer and information sciences. To bring these two terms together, we first define a novel conditional connectivity measure: k-domination edge connectivity. In this study we compute k-domination edge connectivity of paths, cycles and complete graphs.
Files
GALA 2(2024)1-10.pdf
Files
(349.1 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:c417ac089a781a749807ee5c65c61543
|
349.1 kB | Preview Download |