Complementary edge domination in graphs
A subset \(F\) of the edge set \(E\) of a graph \(G\) is called an edge dominating set, if each edge of \(E-F\) has a common end vertex with an edge of \(F\). If there exists an edge dominating set \(F'\subseteq E-F\), where \(F\) is an edge dominating set, then \(F'\) is called a complementary edge dominating set. The minimum number of edges of a complementary dominating set in \(G\) is the complementary edge domination number \(\gamma_c'(G)\) of \(G\). In the paper, this numerical invariant of a graph is compared with others, namely with the edge domination number, with the edge independence number and with the maximum degree. Exact values of \(\gamma_c'(G)\) are found for complete graphs, complete bipartite graphs, circuits, paths, and wheels. At the end, results of the Nordhaus-Gaddum type are presented.
- On simple totally complemented-edged graphs
- Complement free domination number of a bipartite graph
- Complementary nil vertex edge dominating sets
- scientific article; zbMATH DE number 5688474 (Why is no real title available?)
- scientific article; zbMATH DE number 146665 (Why is no real title available?)
- scientific article; zbMATH DE number 2001452 (Why is no real title available?)
- Edge domination in some path and cycle related graphs
- scientific article; zbMATH DE number 867662 (Why is no real title available?)
- RESTRAINED EDGE DOMINATION IN GRAPHS
- Edge domination in Boolean function graph \(\mathrm{B}(\overline{Kp}, \mathrm{L(G), NINC})\) of a graph
- RESTRAINED TOTAL EDGE DOMINATION IN THE JOIN OF GRAPHS
- PERFECT EDGE DOMINATION IN GRAPHS
- Complementary edge domination in shadow distance graphs
- Edge domination and total edge domination in the corona of graphs
- scientific article; zbMATH DE number 6749458 (Why is no real title available?)
This page was built for publication: Complementary edge domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369009)
