Nordhaus–Gaddum-Type Results on the Connected Edge Domination Number

A connected edge dominating set of a connected graph G = ( V , E ) is a subset X of E such that the edge-induced subgraph G [ X ] is connected and each e ∈ E ( G ) \ X has at least one neighbor in X . The connected edge domination number γ c ′ ( G ) of G is the minimum cardinality of a connected edg...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Bulletin of the Malaysian Mathematical Sciences Society 2024-03, Vol.47 (2), Article 54
Hauptverfasser:	Li, Hengzhe, Liu, Huayue, Liu, Jianbing
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications of Mathematics Graph theory Graphs Lower bounds Mathematics Mathematics and Statistics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!