Edge domination in graphs
From MaRDI portal
Publication:1392425
DOI10.11650/TWJM/1500406930zbMATH Open0906.05032OpenAlexW4254993802MaRDI QIDQ1392425FDOQ1392425
Authors: S. Arumugam, S. Velammal 
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
Recommendations
Cited In (43)
- On co-edge tree domination and co-edge spanning tree domination in graphs
- Some new approaches in edge domination
- Title not available (Why is that?)
- The edge-to-edge geodetic domination number of a graph
- Title not available (Why is that?)
- Vertex-edge domination in graphs
- Edge domination in complete partite graphs
- On the domination number of a graph and its block graph
- Title not available (Why is that?)
- RESTRAINED EDGE DOMINATION IN GRAPHS
- Title not available (Why is that?)
- On the algorithmic complexity of edge total domination
- The algorithmic complexity of mixed domination in graphs
- Title not available (Why is that?)
- On coefficients of edge domination polynomial of a graph
- The edge domination number of connected graphs
- Edge domination in some path and cycle related graphs
- Title not available (Why is that?)
- EDGE DOMINATION AND TOTAL EDGE DOMINATION IN THE CORONA OF GRAPHS
- An efficient algorithm for distance total domination in block graphs
- PERFECT EDGE DOMINATION IN GRAPHS
- Efficient edge domination in regular graphs
- Edge domination in Boolean function graph B(L(G), NINC) of a graph
- Vertex-edge domination in unit disk graphs
- Complexity and characterization aspects of edge-related domination for graphs
- Nordhaus-Gaddum-type results on the connected edge domination number
- Rainbow edge domination numbers in graphs
- Domination in edge cycle graphs
- Connected edge domination in graphs
- Perfect edge domination and efficient edge domination in graphs
- Title not available (Why is that?)
- DOMINATION AND EDGE DOMINATION IN TREES
- Edge-domatic number of a graph
- The edge domination problem
- Two classes of edge domination in graphs
- Title not available (Why is that?)
- RESTRAINED TOTAL EDGE DOMINATION IN THE JOIN OF GRAPHS
- Roman edge semi-total block domination of a graph
- On the line graph of the zero divisor graph for the ring of Gaussian integers modulo \(n\)
- Minimum Edge Dominating Sets
- Effects of edge lifting on domination in graphs
- Independent edge dominating set of certain graphs
- Edge degrees and dominating cycles
This page was built for publication: Edge domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1392425)
