Pages that link to "Item:Q1283874"
From MaRDI portal
The following pages link to New bounds for codes identifying vertices in graphs (Q1283874):
Displaying 15 items.
- Identifying codes for infinite triangular grids with a finite number of rows (Q526246) (← links)
- Identifying codes in some subgraphs of the square lattice (Q596073) (← links)
- Open neighborhood locating-dominating in trees (Q628345) (← links)
- On robust identification in the square and King grids (Q860410) (← links)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- Periodicity of identifying codes in strips (Q1708274) (← links)
- On identification in the triangular grid (Q1826954) (← links)
- On the density of identifying codes in the square lattice (Q1850615) (← links)
- Identifying codes in the complementary prism of cycles (Q2132351) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- Minimum-Density Identifying Codes in Square Grids (Q2830060) (← links)
- Liar's domination (Q3057104) (← links)
- Minimum density of identifying codes of king grids (Q5915700) (← links)
- Minimum density of identifying codes of king grids (Q5920174) (← links)