K-edge dominating set in graphs

AIP conference proceedings 2026

View at publisher
Authors: Abdullah M. Rifaat, Nabeel E. Arif
DOI: 10.1063/5.0318204
Cited by: 0
References: 15

Abstract

Let G be a finite simple graph, undirected, for any positive integer π‘˜ , a dominating set D of 𝑉(𝐺) is called k-edge dominating set of G if D is dominating set and the number of edges between vertices in 𝐷 ≀ 𝐾, 𝐾 = 1, 2, … where k is minimum of edges in G is called k-edge dominating set. And k-edge domination number denoted by π›Ύπ‘Žπ‘›(𝐺). In this paper, k-edge domination number is found for a will know graph.

Fields of Study & Subjects

Advanced Graph Theory Research Graph Labeling and Dimension Problems Complexity and Algorithms in Graphs

Publication details

Journal / source
AIP conference proceedings
Volume
3393
Pages
070055–070055
Publication date
1 January 2026
Language
EN