On identifying vertices of tournament digraphs
From MaRDI portal
Cites work
- A linear algorithm for minimum 1-identifying codes in oriented trees
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
- Characterizing identifying codes from the spectrum of a graph or digraph
- Cyclic tournaments and cooperative majority voting: A solution
- Domination and location in twin-free digraphs
- Doubly regular tournaments are equivalent to skew Hadamard matrices
- Extremal Digraphs for open neighbourhood location-domination and identifying codes
- Handbook of Graph Theory
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 3679856 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- Identifying and locating-dominating codes: NP-completeness results for directed graphs
- Identifying codes in line digraphs
- Identifying codes on directed de Bruijn graphs
- Locating-dominating sets in local tournaments
- Locating-dominating sets: from graphs to oriented graphs
- Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
- Normally regular digraphs
- Normally regular digraphs, association schemes and related combinatorial structures
- On a new class of codes for identifying vertices in graphs
- On the minimum size of an identifying code over all orientations of a graph
- Quasi-carousel tournaments
This page was built for publication: On identifying vertices of tournament digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6847379)
