More odd graph theory
From MaRDI portal
Publication:1141662
DOI10.1016/0012-365X(80)90055-2zbMath0438.05053MaRDI QIDQ1141662
Publication date: 1980
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (22)
Distance-regular Cayley graphs with least eigenvalue \(-2\) ⋮ Characterization of graphs which admit vertex‐transitive embeddings ⋮ On quasi-Cayley graphs ⋮ Mobility of vertex-transitive graphs ⋮ On total coloring of some classes of regular graphs ⋮ On adjacency-transitive graphs ⋮ More odd graph theory from another point of view ⋮ Set labelling vertices to ensure adjacency coincides with disjointness ⋮ Cutoff phenomenon for random walks on Kneser graphs ⋮ \(r\)-regular families of graph automorphisms ⋮ Groups that are transitive on all partitions of a given shape ⋮ Explicit 2-factorizations of the odd graph ⋮ Cayley properties of the line graphs induced by consecutive layers of the hypercube ⋮ Some meta-Cayley graphs on dihedral groups ⋮ Cayley properties of merged Johnson graphs ⋮ Expanding and forwarding ⋮ Distance-regular Cayley graphs with small valency ⋮ Hypergroups and distance distributions of random walks on graphs ⋮ Counterexamples to “A conjecture on induced subgraphs of Cayley graphs” ⋮ On Middle Cube Graphs ⋮ Sidon sets in groups and induced subgraphs of Cayley graphs ⋮ The antipodal layers problem
Cites Work
This page was built for publication: More odd graph theory