Line domination in graphs
From MaRDI portal
The line domination number of a graph is the minimum number of edges with the property that every other edge is adjacent to some of these edges. Several results, especially bounds, on this number are presented.
Recommendations
Cites work
- Edge-domatic number of a graph
- scientific article; zbMATH DE number 3674114 (Why is no real title available?)
- scientific article; zbMATH DE number 3702724 (Why is no real title available?)
- scientific article; zbMATH DE number 3432294 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3307328 (Why is no real title available?)
- Towards a theory of domination in graphs
Cited in
(12)- The line neighbourhood number of a graph
- Line-set domination number of a graph
- On line independence, domination, irredundance and neighbourhood numbers of a graph
- Study of domination in Grotzsch graph
- Edge domination in some path and cycle related graphs
- scientific article; zbMATH DE number 1416472 (Why is no real title available?)
- Edge domination and 2-independence in trees
- Edge domination in Boolean function graph \(\mathrm{B}(\overline{Kp}, \mathrm{L(G), NINC})\) of a graph
- On coefficients of edge domination polynomial of a graph
- Rainbow edge domination numbers in graphs
- Line-set domination in graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: Line domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1092932)
