Even sum domination in graphs with algorithm

Even sum domination in graphs with algorithm

In this paper, the two new parameter of domination in graph that called even sum domination and inverse even sum domination are introduced. Many of properties of these numbers are been discussed especially on the certain graphs as cycle, path, complete, complete bipartite, star, null, and wheel. Mor...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Rasheed, Ihsan M., Omran, Ahmed A.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithms
Graphs
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, the two new parameter of domination in graph that called even sum domination and inverse even sum domination are introduced. Many of properties of these numbers are been discussed especially on the certain graphs as cycle, path, complete, complete bipartite, star, null, and wheel. Moreover, a linear-time algorithm for the ES domination problem in wheels is written and the NP-complete of ES domination problem is proved.
ISSN:0094-243X
1551-7616
DOI:10.1063/5.0067152