Connected edge domination in graphs
From MaRDI portal
Recommendations
Cited in
(24)- Complementary edge domination in graphs
- On the number of edges in graphs with a given connected domination number
- 2-(edge-)connected edge domination number and matching number
- Maximum size of a connected graph with given domination parameters
- Connected domination in litact graph
- Neighborhood connected edge domination in graphs
- Further results on connected eccentric domination number in graphs
- The edge domination number of connected graphs
- scientific article; zbMATH DE number 5972305 (Why is no real title available?)
- Edge-domatic number of a graph
- Connected domination
- On co-edge tree domination and co-edge spanning tree domination in graphs
- Independent edge dominating set of certain graphs
- scientific article; zbMATH DE number 2068372 (Why is no real title available?)
- scientific article; zbMATH DE number 6921365 (Why is no real title available?)
- scientific article; zbMATH DE number 861339 (Why is no real title available?)
- Edge dominating graph of a graph
- The edge-to-edge geodetic domination number of a graph
- scientific article; zbMATH DE number 6749458 (Why is no real title available?)
- Boundary edge domination in graphs
- Some new approaches in edge domination
- Domination in edge cycle graphs
- Nordhaus-Gaddum-type results on the connected edge domination number
- Nordhaus-Gaddum type results for connected domination number of graphs
This page was built for publication: Connected edge domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322234)