Phylogeny numbers of generalized Hamming graphs
From MaRDI portal
Publication:2082421
DOI10.1007/s40840-022-01338-5zbMath1498.05088OpenAlexW4283660098MaRDI QIDQ2082421
Yaokun Wu, Yanzhen Xiong, Chengyang Qian
Publication date: 4 October 2022
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-022-01338-5
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Linear algebra and bootstrap percolation
- The competition numbers of ternary Hamming graphs
- A complete characterization of paths that are \(m\)-step competition graphs
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- The competition-common enemy graph of a digraph
- Niche graphs
- Phylogeny numbers
- The \(m\)-step competition graph of a digraph
- The difficulty of being moral
- A characterization of Johnson and Hamming graphs and proof of Babai's conjecture
- Competition numbers and phylogeny numbers: uniform complete multipartite graphs
- Norton algebras of the Hamming graphs via linear characters
- On well-connected sets of strings
- The niche graphs of bipartite tournaments
- Eigenfunctions and minimum 1-perfect bitrades in the Hamming graph
- Tree-like partial Hamming graphs
- THE COMPETITION NUMBERS OF HAMMING GRAPHS WITH DIAMETER AT MOST THREE
- Eigenspaces of Hamming graphs and unitary Cayley graphs
- On the Computation of the Competition Number of a Graph
- Competition Numbers and Phylogeny Numbers of Connected Graphs and Hypergraphs
- Perfect 2‐colorings of Hamming graphs
This page was built for publication: Phylogeny numbers of generalized Hamming graphs
