Phylogeny numbers of generalized Hamming graphs
From MaRDI portal
Recommendations
Cites work
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
- A complete characterization of paths that are m-step competition graphs
- Competition numbers and phylogeny numbers of connected graphs and hypergraphs
- Competition numbers and phylogeny numbers: uniform complete multipartite graphs
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
- Eigenspaces of Hamming graphs and unitary Cayley graphs
- scientific article; zbMATH DE number 3606214 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- Linear algebra and bootstrap percolation
- Niche graphs
- Norton algebras of the Hamming graphs via linear characters
- On the Computation of the Competition Number of a Graph
- On well-connected sets of strings
- Perfect 2‐colorings of Hamming graphs
- Phylogeny numbers
- The \(m\)-step competition graph of a digraph
- The competition numbers of Hamming graphs with diameter at most three
- The competition numbers of ternary Hamming graphs
- The competition-common enemy graph of a digraph
- The difficulty of being moral
- The niche graphs of bipartite tournaments
- Tree-like partial Hamming graphs
Cited in
(4)
This page was built for publication: Phylogeny numbers of generalized Hamming graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2082421)