Pages that link to "Item:Q4400275"
From MaRDI portal
The following pages link to On a new class of codes for identifying vertices in graphs (Q4400275):
Displaying 50 items.
- New bounds on the minimum density of an identifying code for the infinite hexagonal grid (Q2446882) (← links)
- Locally identifying coloring in bounded expansion classes of graphs (Q2446886) (← links)
- Identifying codes of corona product graphs (Q2449061) (← links)
- Locating sensors in paths and cycles: the case of 2-identifying codes (Q2462318) (← links)
- Identifying codes of cycles (Q2488842) (← links)
- Monotonicity of the minimum cardinality of an identifying code in the hypercube (Q2492191) (← links)
- A linear algorithm for minimum 1-identifying codes in oriented trees (Q2495905) (← links)
- On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367) (← links)
- An unexpected result in coding the vertices of a graph (Q2527412) (← links)
- Fault-tolerant detectors for distinguishing sets in cubic graphs (Q2659159) (← links)
- On redundant locating-dominating sets (Q2686136) (← links)
- Codes for strong identification (Q2741420) (← links)
- Minimum-Density Identifying Codes in Square Grids (Q2830060) (← links)
- Separating Codes and Traffic Monitoring (Q2830061) (← links)
- Identifying codes in trees and planar graphs (Q2851521) (← links)
- Edge identifying codes (Q2857369) (← links)
- On Graph Identification Problems and the Special Case of Identifying Vertices Using Paths (Q2876554) (← links)
- Vertex identifying codes for the \(n\)-dimensional lattice (Q2906869) (← links)
- Identifying codes and watching systems in Kneser graphs (Q2966507) (← links)
- Complexity results for identifying codes in planar graphs (Q3002553) (← links)
- Liar's domination (Q3057104) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- Codes Identifying Vertices in Graphs (Q3439339) (← links)
- On the Structure of Identifiable Graphs (Q3439386) (← links)
- Discriminating codes in bipartite graphs (Q3439638) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- (Q3472148) (← links)
- Identifying and Locating–Dominating Codes in (Random) Geometric Networks (Q3557518) (← links)
- r-Identifying codes in binary Hamming space, q-ary Lee space and incomplete hypercube (Q4634300) (← links)
- (Q4948746) (← links)
- Minimum identifying codes in some graphs differing by matchings (Q4965914) (← links)
- Bounds on r-identifying codes in q-ary Lee space (Q4986273) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- Sequential metric dimension for random graphs (Q5014301) (← links)
- The open-locating-dominating number of some convex polytopes (Q5014387) (← links)
- Revisiting and Improving Upper Bounds for Identifying Codes (Q5048300) (← links)
- ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS (Q5075640) (← links)
- The identifying code number and Mycielski's construction of graphs (Q5104009) (← links)
- (Q5135780) (← links)
- On Optimal Edge-Robust and Vertex-Robust $(1,\leq l)$-Identifying Codes (Q5317591) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)
- Tolerant identification with Euclidean balls (Q5326789) (← links)
- Links Between Discriminating and Identifying Codes in the Binary Hamming Space (Q5386104) (← links)
- Almost Every n-Vertex Graph is Determined by Its 3log2n-Vertex Subgraphs (Q5859639) (← links)
- Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs (Q5864729) (← links)
- (Q5878174) (← links)
- Minimum density of identifying codes of king grids (Q5915700) (← links)
- Sequential metric dimension (Q5918179) (← links)
- Minimum density of identifying codes of king grids (Q5920174) (← links)
