On n-inverse domination number in graphs
From MaRDI portal
Publication:3085677
zbMATH Open1210.05101MaRDI QIDQ3085677FDOQ3085677
Authors: B. Janakiram, V. R. Kulli
Publication date: 31 March 2011
Recommendations
Cited In (15)
- Title not available (Why is that?)
- Inverse dominating set in fuzzy graphs
- On a problem of Domke, Dunbar, Haynes, Hedetniemi, and Markus concerning the inverse domination number
- On the difference of the domination number of a digraph and of its reverse
- New parameter of inverse domination in graphs
- Title not available (Why is that?)
- Graphs with constant sum of domination and inverse domination numbers
- Inverse and disjoint neighborhood total dominating sets in graphs
- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs
- Inverse vertex covering number of a graph
- Inverse odd neighbor in \(D^{-1^c}\) domination number in graphs
- Upper bounds for inverse domination in graphs
- Inverse total domination in graphs
- INVERSE MINUS DOMINATION IN GRAPHS
- The nm-domination number of a graph
This page was built for publication: On \(n\)-inverse domination number in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3085677)