Generalized perfect domination in graphs
From MaRDI portal
Publication:2444147
DOI10.1007/S10878-012-9510-YzbMATH Open1290.90081OpenAlexW2059231483MaRDI QIDQ2444147FDOQ2444147
Authors: B. Chaluvaraju, K. A. Vidya
Publication date: 8 April 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: http://eprints-bangaloreuniversity.in/4285/1/Cheluvaraju.pdf
Recommendations
- scientific article; zbMATH DE number 933213
- Generalized domination and efficient domination in graphs
- Perfect \(k\)-domination in graphs
- Generalized connected domination in graphs
- On perfect and quasiperfect dominations in graphs
- Generalized power domination of graphs
- Domination in generalized Petersen graphs
- A characterization of domination perfect graphs
- Domination in generalized circulant graphs
- Dominating sets in perfect graphs
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The weighted perfect domination problem and its variants
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect \(k\)-domination in graphs
- Bounds on perfect \(k\)-domination in trees: an algorithmic approach
Cited In (15)
- \(k\)-perfect geodominating sets in graphs
- On generalized perfect graphs: Bounded degree and bounded edge perfection
- Perfect \(k\)-domination in graphs
- Perfect domination polynomial of homogeneous caterpillar graphs and of full binary trees
- Perfect domination in regular grid graphs
- Superlative total domination in graphs
- Perfect and quasiperfect domination in trees
- Perfect domination in knights graphs
- Title not available (Why is that?)
- Quasiperfect domination in trees
- Perfect Italian domination on planar and regular graphs
- On perfect and quasiperfect dominations in graphs
- DUAL-PERFECT DOMINATION IN GRAPHS
- Bounds on perfect \(k\)-domination in trees: an algorithmic approach
- A general method in the theory of domination in graphs
This page was built for publication: Generalized perfect domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2444147)