Diameter bounds and recursive properties of Full-Flag Johnson graphs
From MaRDI portal
Publication:1752664
DOI10.1016/j.disc.2018.03.014zbMath1387.05110OpenAlexW2796873633WikidataQ129980555 ScholiaQ129980555MaRDI QIDQ1752664
Publication date: 24 May 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.03.014
Related Items (3)
Eigenvalues of Cayley graphs ⋮ The second eigenvalue of some normal Cayley graphs of highly transitive groups ⋮ Signal processing on the permutahedron: tight spectral frames for ranked data analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notes on simplicial rook graphs
- On the spectra of simplicial rook graphs
- Graph properties of graph associahedra
- The complexity of finding minimum-length generator sequences
- Hamiltonian uniform subset graphs
- Sorting by bounded block-moves
- On the chromatic number of some geometric type Kneser graphs
- On the girth and diameter of generalized Johnson graphs
- The diameter of associahedra
- Coxeter complexes and graph-associahedra
- Combinatorial Properties of Full-Flag Johnson Graphs
- Johnson graphs are Hamilton-connected
- On the spectra of Johnson graphs
- Permutohedra, Associahedra, and Beyond
- The minimum-length generator sequence problem is NP-hard
- Optimal Sorting Algorithms for Parallel Computers
- Sorting by Transpositions
- Generation of Permutations by Adjacent Transposition
- On the Connectedness and Diameter of a Geometric Johnson Graph
- Interval exchange transformations
This page was built for publication: Diameter bounds and recursive properties of Full-Flag Johnson graphs