scientific article; zbMATH DE number 7655282
From MaRDI portal
Publication:5878174
DOI10.22124/jart.2022.20661.1321MaRDI QIDQ5878174
Kamran Mirasheh, Ebrahim Vatandoost
Publication date: 19 February 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- On the size of identifying codes in triangle-free graphs
- Identifying codes and locating-dominating sets on paths and cycles
- Codes identifying sets of vertices in random networks
- Minimal identifying codes in trees and planar graphs with large girth
- Extremal graphs for the identifying code problem
- Identifying codes of cycles
- On a new class of codes for identifying vertices in graphs
- On Identifying Codes in the Triangular and Square Grids
- Outer independent rainbow dominating functions in graphs
- On 2-rainbow domination number of functigraph and its complement
- On the roman domination number of generalized Sierpiński graphs
