Pages that link to "Item:Q1283874"
From MaRDI portal
The following pages link to New bounds for codes identifying vertices in graphs (Q1283874):
Displaying 28 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 a new class of identifying codes in graphs (Q845971) (← links)
- On robust identification in the square and King grids (Q860410) (← links)
- On graphs having a \(V\setminus \{x\}\) set as an identifying code (Q864130) (← links)
- The minimum density of an identifying code in the king lattice. (Q1422415) (← links)
- On strongly identifying codes (Q1613540) (← 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)
- On the identification of vertices using cycles (Q1871370) (← links)
- Neighborhood distinguishing coloring in graphs (Q2016994) (← links)
- Identifying codes in the complementary prism of cycles (Q2132351) (← links)
- Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954) (← links)
- Sphere coverings and identifying codes (Q2436572) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- Bounds on codes derived by counting components in Varshamov graphs (Q2491316) (← links)
- An unexpected result in coding the vertices of a graph (Q2527412) (← links)
- Bounds for codes identifying vertices in the hexagonal grid (Q2706181) (← links)
- Minimum-Density Identifying Codes in Square Grids (Q2830060) (← links)
- Vertex identifying codes for the \(n\)-dimensional lattice (Q2906869) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- Liar's domination (Q3057104) (← links)
- On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes (Q5317591) (← links)
- Minimum density of identifying codes of king grids (Q5915700) (← links)
- Minimum density of identifying codes of king grids (Q5920174) (← links)
