Downloads provided by UsageCounts
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.
k-domination edge connectivity, domination connectivity
k-domination edge connectivity, domination connectivity
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 34 | |
| downloads | 32 |

Views provided by UsageCounts
Downloads provided by UsageCounts