Domination number and identifying code number of the subdivision graphs
From MaRDI portal
Cites work
- Codes identifying sets of vertices in random networks
- Graphs with equal domination and certified domination numbers
- scientific article; zbMATH DE number 6815662 (Why is no real title available?)
- Identifying codes and locating-dominating sets on paths and cycles
- Identifying codes of cycles
- Minimal identifying codes in trees and planar graphs with large girth
- On 2-rainbow domination number of functigraph and its complement
- On a new class of codes for identifying vertices in graphs
- On Identifying Codes in the Triangular and Square Grids
- On the roman domination number of generalized Sierpiński graphs
- On the size of identifying codes in triangle-free graphs
- Outer independent rainbow dominating functions in graphs
- SIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
- The identifying code number and functigraphs
- Vertex identifying codes for fault isolation in communication networks
- Watching systems in graphs: an extension of identifying codes
Cited in
(3)
This page was built for publication: Domination number and identifying code number of the subdivision graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7005907)