Distance $k$-domination in some cycle related graphs

Distance $k$-domination in some cycle related graphs

In this paper we determine distance k-domination number of graph obtained by duplication of vertices altogether by edges in cycle Cn, splitting graph of cycle Cn as well as graph obtained by duplication of edges altogether by vertices in cycle Cn.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Mathematical notes (Miskolci Egyetem (Hungary)) 2018, Vol.19 (2), p.1223-1231
Hauptverfasser: Vaidya, S. K., Kothari, N. J.
Format: Artikel
Sprache:eng
Schlagworte:
Apexes
Graph theory
Reproduction (copying)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper we determine distance k-domination number of graph obtained by duplication of vertices altogether by edges in cycle Cn, splitting graph of cycle Cn as well as graph obtained by duplication of edges altogether by vertices in cycle Cn.
ISSN:1787-2405
1787-2413
DOI:10.18514/MMN.2018.1163