The following pages link to (Q4871068):
Displaying 33 items.
- Locating-total dominating sets in twin-free graphs: a conjecture (Q311495) (← links)
- Location-domination in line graphs (Q329538) (← links)
- Improved bounds on the domination number of a tree (Q406327) (← links)
- Some comments on the Slater number (Q526227) (← links)
- Open neighborhood locating-dominating in trees (Q628345) (← links)
- On locating--dominating sets in infinite grids (Q819007) (← links)
- On a new class of identifying codes in graphs (Q845971) (← links)
- Fault tolerant detectors for distinguishing sets in graphs (Q891327) (← links)
- Locating-dominating sets in twin-free graphs (Q906432) (← links)
- Location-domination and matching in cubic graphs (Q906465) (← links)
- Locating and paired-dominating sets in graphs (Q967383) (← links)
- On identifying codes in the hexagonal mesh (Q1029036) (← links)
- Well-located graphs: A collection of well-covered ones (Q1422424) (← links)
- Bounds on the domination number of a digraph (Q1698058) (← links)
- On the density of identifying codes in the square lattice (Q1850615) (← links)
- Identifying and locating-dominating codes on chains and cycles (Q1883609) (← links)
- Revisiting \(k\)-tuple dominating sets with emphasis on small values of \(k\) (Q2147590) (← links)
- Locating-dominating codes in paths (Q2275442) (← links)
- The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination (Q2282474) (← links)
- Binary locating-dominating sets in rotationally-symmetric convex polytopes (Q2337871) (← links)
- Locating-dominating sets and identifying codes in graphs of girth at least 5 (Q2344817) (← links)
- On identifying codes that are robust against edge changes (Q2373878) (← links)
- An optimal locating-dominating set in the infinite triangular grid (Q2433724) (← links)
- Locating and identifying codes in circulant networks (Q2446842) (← links)
- Locating and total dominating sets in trees (Q2495911) (← links)
- Locating-Domination and Identification (Q3384611) (← links)
- The binary locating-dominating number of some convex polytopes (Q4604525) (← links)
- Open-independent, open-locating-dominating sets (Q5006616) (← links)
- ON MULTIPLE INTRUDER LOCATING DOMINATION IN INFINITE GRIDS (Q5075640) (← links)
- The set of all values of the domination number in trees with a given degree sequence (Q5090145) (← links)
- Partial domination - the isolation number of a graph (Q5162046) (← links)
- A note on lower bounds for the total domination number of digraphs (Q5236092) (← links)
- On the binary locating-domination number of regular and strongly-regular graphs (Q6200320) (← links)
