2-(edge-)connected edge domination number and matching number

DOI10.1007/S00373-023-02626-YOpenAlexW4360977085MaRDI QIDQ2698534FDOQ2698534

Authors: Hengzhe Li, Ankang Wei, Shenggui Zhang 

Publication date: 24 April 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-023-02626-y

Recommendations

• 2-edge connected dominating sets and 2-connected dominating sets of a graph
• The edge domination number of connected graphs
• Connected edge domination in graphs
• Making a dominating set of a graph connected
• Doubly connected edge domination number of a graph

zbMATH Keywords

edge dominating setmaximal matchingconnected edge dominating set

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Graph theory
• Title not available (Why is that?)
• Approximation algorithms for NP-complete problems on planar graphs
• Edge Dominating Sets in Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• On constructing \(k\)-connected \(k\)-dominating set in wireless ad hoc and sensor networks
• Title not available (Why is that?)
• Smallest maximal matchings in the graph of the d-dimensional cube
• Maximum matching and kernelization of edge dominating set
• 2-edge connected dominating sets and 2-connected dominating sets of a graph
• The nm-domination number of a graph
• Connected edge domination in graphs

Cited In (2)

• Nordhaus-Gaddum-type results on the connected edge domination number
• 2-edge connected dominating sets and 2-connected dominating sets of a graph

This page was built for publication: 2-(edge-)connected edge domination number and matching number

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