Nordhaus-Gaddum-type results on the connected edge domination number

DOI10.1007/s40840-023-01649-1OpenAlexW4391532899WikidataQ128661396 ScholiaQ128661396MaRDI QIDQ6202040

Hengzhe Li, Huayue Liu, Jian-Bing Liu

Publication date: 21 February 2024

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-023-01649-1

zbMATH Keywords

dominating setindependent numberconnected edge dominating set

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connected dominating set. Theory and applications
• Connected domination number of a graph and its complement
• \(k\)-domination and \(k\)-independence in graphs: A survey
• A greedy approximation for minimum connected dominating sets
• Approximation algorithms for connected dominating sets
• Edge domination in graphs
• Making a dominating set of a graph connected
• On the semitotal domination number of line graphs
• A survey of Nordhaus-Gaddum type relations
• The complexity of total edge domination and some related results on trees
• Complexity and characterization aspects of edge-related domination for graphs
• Bounding and approximating minimum maximal matchings in regular graphs
• Edge Dominating Sets in Graphs
• 2-edge connected dominating sets and 2-connected dominating sets of a graph

This page was built for publication: Nordhaus-Gaddum-type results on the connected edge domination number