Pages that link to "Item:Q851780"
From MaRDI portal
The following pages link to Constructing codes identifying sets of vertices (Q851780):
Displaying 7 items.
- Optimal identification of sets of edges using 2-factors (Q389983) (← links)
- On graphs having a \(V\setminus \{x\}\) set as an identifying code (Q864130) (← links)
- Construction of codes identifying sets of vertices (Q1773205) (← links)
- Tighter bounds on the independence number of the Birkhoff graph (Q2145765) (← links)
- Watching systems in graphs: an extension of identifying codes (Q2446294) (← links)
- An unexpected result in coding the vertices of a graph (Q2527412) (← links)
- Vertex identifying codes for the \(n\)-dimensional lattice (Q2906869) (← links)