Edge domination in graphs
From MaRDI portal
Publication:1392425
DOI10.11650/twjm/1500406930zbMath0906.05032OpenAlexW4254993802MaRDI QIDQ1392425
Publication date: 28 July 1998
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.11650/twjm/1500406930
Related Items (22)
Perfect edge domination and efficient edge domination in graphs ⋮ RESTRAINED EDGE DOMINATION IN GRAPHS ⋮ Edge domination in Boolean function graph B(L(G), NINC) of a graph ⋮ On the algorithmic complexity of edge total domination ⋮ On the domination number of a graph and its block graph ⋮ On coefficients of edge domination polynomial of a graph ⋮ RESTRAINED TOTAL EDGE DOMINATION IN THE JOIN OF GRAPHS ⋮ PERFECT EDGE DOMINATION IN GRAPHS ⋮ Roman edge semi-total block domination of a graph ⋮ Nordhaus-Gaddum-type results on the connected edge domination number ⋮ DOMINATION AND EDGE DOMINATION IN TREES ⋮ Unnamed Item ⋮ Edge domination in some path and cycle related graphs ⋮ On the line graph of the zero divisor graph for the ring of Gaussian integers modulo \(n\) ⋮ The algorithmic complexity of mixed domination in graphs ⋮ Unnamed Item ⋮ Complexity and characterization aspects of edge-related domination for graphs ⋮ An efficient algorithm for distance total domination in block graphs ⋮ Unnamed Item ⋮ EDGE DOMINATION AND TOTAL EDGE DOMINATION IN THE CORONA OF GRAPHS ⋮ Rainbow edge domination numbers in graphs ⋮ The edge-to-edge geodetic domination number of a graph
This page was built for publication: Edge domination in graphs