The symmetry property of (n,k)‐arrangement graph
From MaRDI portal
Publication:6056782
DOI10.1002/jgt.22690OpenAlexW3169496942MaRDI QIDQ6056782
Yan Quan Feng, Jin-Xin Zhou, Fugang Yin, Yu-Hong Guo
Publication date: 4 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22690
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Automorphism groups of Cayley graphs generated by connected transposition sets
- Groups that are transitive on all partitions of a given shape
- The number of shortest paths in the arrangement graph
- Fault diagnosability of arrangement graphs
- Edge-fault-tolerant pancyclicity of arrangement graphs
- The automorphism group of the alternating group graph
- Conditional matching preclusion for the arrangement graphs
- 2-arc-transitive regular covers of complete graphs having the covering transformation group \(Z^{3}_{p}\)
- Homogeneous designs and geometric lattices
- Hamiltonicity and colorings of arrangement graphs
- Automorphism group of the complete transposition graph
- Arrangement graphs: A class of generalized star graphs
- Non-Cayley vertex-transitive graphs of order twice the product of two odd primes
- The Magma algebra system. I: The user language
- A complete classification of which \((n,k)\)-star graphs are Cayley graphs
- Square-free non-Cayley numbers. On vertex-transitive non-Cayley graphs of square-free order.
- 2-arc-transitive regular covers of $K_{n,n}$ having the covering transformation group $\mathbb{Z}_p^2$
- The paths embedding of the arrangement graphs with prescribed vertices in given position
- Conditional fault tolerance of arrangement graphs
- The spectra of arrangement graphs
- Fractional matching preclusion for arrangement graphs
- The edge-centered surface area of the arrangement graph
- On the eigenvalues of certain Cayley graphs and arrangement graphs
- Fault tolerance in the arrangement graphs
- Transitivity of finite permutation groups on unordered sets
- \(k\)-homogeneous groups
- Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
- On the arrangement graph.
- A transversal property for permutation groups motivated by partial transformations
- On cubic non-Cayley vertex-transitive graphs
- On a Class of Fixed-Point-Free Graphs
- A group-theoretic model for symmetric interconnection networks
- Which generalized petersen graphs are cayley graphs?
- Lifting a prescribed group of automorphisms of graphs
- The classification of \frac{3}2-transitive permutation groups and \frac{1}2-transitive linear groups
- A new class of interconnection networks based on the alternating group
- Linearly many faults in arrangement graphs
This page was built for publication: The symmetry property of (n,k)‐arrangement graph