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

DOI10.1007/S40840-023-01649-1MaRDI QIDQ6202040zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• Connected edge domination in graphs
• 2-(edge-)connected edge domination number and matching number
• 2-edge connected dominating sets and 2-connected dominating sets of a graph
• Nordhaus-Gaddum type results for connected and total domination
• Nordhaus-Gaddum type results for connected domination number of graphs

Cites work

• scientific article; zbMATH DE number 437479 (Why is no real title available?)
• scientific article; zbMATH DE number 3674114 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 2209525 (Why is no real title available?)
• 2-edge connected dominating sets and 2-connected dominating sets of a graph
• A greedy approximation for minimum connected dominating sets
• A survey of Nordhaus-Gaddum type relations
• Approximation algorithms for connected dominating sets
• Bounding and approximating minimum maximal matchings in regular graphs
• Complexity and characterization aspects of edge-related domination for graphs
• Connected dominating set. Theory and applications
• Connected domination number of a graph and its complement
• Connected edge domination in graphs
• Edge Dominating Sets in Graphs
• Edge domination in graphs
• Graph theory
• Making a dominating set of a graph connected
• On the semitotal domination number of line graphs
• The complexity of total edge domination and some related results on trees
• \(k\)-domination and \(k\)-independence in graphs: A survey

Cited in

(1)

• Nordhaus-Gaddum type results for connected domination number of graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202040)