Complementary edge domination in graphs
From MaRDI portal
Publication:1369009
zbMATH Open0883.05080MaRDI QIDQ1369009FDOQ1369009
Authors: V. R. Kulli, N. D. Soner
Publication date: 7 October 1997
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Recommendations
Cited In (15)
- Edge domination in Boolean function graph \(\mathrm{B}(\overline{Kp}, \mathrm{L(G), NINC})\) of a graph
- Complementary nil vertex edge dominating sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- RESTRAINED EDGE DOMINATION IN GRAPHS
- Complementary edge domination in shadow distance graphs
- Title not available (Why is that?)
- Complement free domination number of a bipartite graph
- Edge domination in some path and cycle related graphs
- PERFECT EDGE DOMINATION IN GRAPHS
- On simple totally complemented-edged graphs
- Title not available (Why is that?)
- RESTRAINED TOTAL EDGE DOMINATION IN THE JOIN OF GRAPHS
- Title not available (Why is that?)
- Edge domination and total edge domination in the corona of graphs
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)