A new class of transitive graphs

DOI10.1016/j.disc.2009.10.004zbMath1213.05123OpenAlexW1994080156MaRDI QIDQ965970

Jian-Wei Wang, Fu-Tao Hu, Jun-Ming Xu

Publication date: 27 April 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.10.004

zbMATH Keywords

automorphism groupHamiltoniandiameterCayley graphsconnectivityhypercubesPetersen graphJohnson graphsKneser graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Structural characterization of families of graphs (05C75)

Related Items (1)

A generalisation of Johnson graphs with an application to triple factorisations

Cites Work

• Unnamed Item
• Unnamed Item
• Primitive decompositions of Johnson graphs
• On the diameter of generalized Kneser graphs
• Local coloring of Kneser graphs
• Two Hamilton cycles in bipartite reflective Kneser graphs
• Characterization of the folded Johnson graphs of small diameter by their intersection arrays
• The multichromatic numbers of some Kneser graphs
• Automorphisms and regular embeddings of merged Johnson graphs
• Kneser graphs are Hamiltonian for \(n\geq 3k\)
• Circular colouring and algebraic no-homomorphism theorems
• Colorful subgraphs in Kneser-like graphs
• Lattices associated with distance-regular graphs
• Large maximal \(\{ 0,1,2,\dots,t\}\)-cliques of the \(q\)-analog of the Johnson graph
• On the diameter of Kneser graphs
• Theory and Application of Graphs
• Connectivity of transitive graphs
• On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection arrays

This page was built for publication: A new class of transitive graphs