Pages that link to "Item:Q2506367"
From MaRDI portal
The following pages link to On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367):
Displaying 10 items.
- The minimum identifying code graphs (Q423972) (← links)
- On the size of identifying codes in triangle-free graphs (Q427898) (← links)
- Identifying codes in vertex-transitive graphs and strongly regular graphs (Q888612) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- (Q2857369) (← links)
- Liar's domination (Q3057104) (← links)
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension (Q3449863) (← links)
- Minimum identifying codes in some graphs differing by matchings (Q4965914) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)