Dominating functions with integer values in graphs—a survey
DOI10.1007/S11741-007-0501-1zbMATH Open1155.05333OpenAlexW2089278233MaRDI QIDQ5456310FDOQ5456310
Authors: Erfang Shan, Liying Kang 
Publication date: 4 April 2008
Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11741-007-0501-1
Recommendations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized domination and efficient domination in graphs
- Signed total domination in graphs.
- Signed Total Domination Nnumber of a Graph
- Remarks on the minus (signed) total domination in graphs
- Lower bounds on several versions of signed domination number
- Two classes of edge domination in graphs
- Title not available (Why is that?)
- Signed domination in regular graphs
- A note on graphs with large girth and small minus domination number
- Minus domination in graphs
- Lower bounds on the minus domination and \(k\)-subdomination numbers.
- Inequalities relating domination parameters in cubic graphs
- Some remarks on domination in cubic graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The algorithmic complexity of the minus clique-transversal problem
- Signed domination in regular graphs and set-systems
- Majority domination in graphs
- Upper bounds for the \(k\)-subdomination number of graphs
- The algorithmic complexity of minus domination in graphs
- On majority domination in graphs
- Upper minus domination in regular graphs
- Upper minus total domination in small-degree regular graphs
- Upper minus total domination of a 5-regular graph
- Title not available (Why is that?)
- Signed total domination in nearly regular graphs
- A note on the lower bounds of signed domination number of a graph
- Title not available (Why is that?)
- On edge domination numbers of graphs
- Title not available (Why is that?)
- The signed star domination numbers of the Cartesian product graphs
- Upper minus domination in a claw-free cubic graph
- Minus \(k\)-subdomination in graphs. II
- Minus \(k\)-subdomination in graphs
- On signed edge domination numbers of graphs
- Minus domination in regular graphs
- A note on domination and minus domination numbers in cubic graphs
- Minus domination number in \(k\)-partite graphs.
- Title not available (Why is that?)
- Minus domination number in cubic graph
- Signed total 2-indepence in graphs
- A proof of a conjecture of minus domination in graphs
- Total minus domination in \(k\)-partite graphs
- Title not available (Why is that?)
- Minus domination in small-degree graphs
- On the Minus Domination Number of Graphs
- Lower bound on the minus-domination number
- \(k\)-subdomination in graphs
- Title not available (Why is that?)
- The signed and minus \(k\)-subdomination numbers of comets
- Title not available (Why is that?)
- Opinion functions on trees
- Strict majority functions on graphs
- Efficient minus and signed domination in graphs
- Title not available (Why is that?)
- The signed total domination number of graphs.
- On a generalization of signed total dominating functions of graphs.
- On signed majority total domination in graphs
Cited In (4)
This page was built for publication: Dominating functions with integer values in graphs—a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5456310)
