More odd graph theory
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 3752880 (Why is no real title available?)
- A new 5‐arc‐transitive cubic graph
- On a Class of Fixed-Point-Free Graphs
- Set-Transitive Permutation Groups
- Transitivity of finite permutation groups on unordered sets
- Vertex-transitive graphs
- k-homogeneous groups
Cited in
(23)- Counterexamples to ``A conjecture on induced subgraphs of Cayley graphs
- Cutoff phenomenon for random walks on Kneser graphs
- Distance-regular Cayley graphs with least eigenvalue \(-2\)
- Hypergroups and distance distributions of random walks on graphs
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Some meta-Cayley graphs on dihedral groups
- \(r\)-regular families of graph automorphisms
- Characterization of graphs which admit vertex‐transitive embeddings
- The antipodal layers problem
- Cayley properties of the line graphs induced by consecutive layers of the hypercube
- On adjacency-transitive graphs
- More odd graph theory from another point of view
- Cayley properties of merged Johnson graphs
- The automorphism group of a complementary prism
- Mobility of vertex-transitive graphs
- On middle cube graphs
- Expanding and forwarding
- On total coloring of some classes of regular graphs
- Explicit 2-factorizations of the odd graph
- On quasi-Cayley graphs
- Distance-regular Cayley graphs with small valency
- Groups that are transitive on all partitions of a given shape
- Set labelling vertices to ensure adjacency coincides with disjointness
This page was built for publication: More odd graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1141662)
