A new class of transitive graphs

DOI10.1016/J.DISC.2009.10.004MaRDI QIDQ965970zbMATH OpenOpenAlexFDO

Authors Fu-Tao Hu, Jianwei Wang, 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 groupCayley graphsconnectivitydiameterHamiltonianhypercubesJohnson graphsKneser graphsPetersen graph

Mathematics Subject Classification ID

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

Recommendations

• The transitivity of special graph classes
• scientific article; zbMATH DE number 5670906
• On transiso-class graphs
• On adjacency-transitive graphs
• A new family of geodesic transitive graphs
• The transitivity of a graph
• scientific article; zbMATH DE number 1379442
• On P-transitive graphs and applications
• scientific article; zbMATH DE number 524154
• scientific article; zbMATH DE number 3939387

Cites work

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

Cited in

(12)

• On adjacency-transitive graphs
• Diameter bounds and recursive properties of Full-Flag Johnson graphs
• Cayley properties of the line graphs induced by consecutive layers of the hypercube
• On the classification of vertex-transitive structures
• A generalisation of Johnson graphs with an application to triple factorisations
• Transitive graphs uniquely determined by their local structure
• Combinatorial properties of full-flag Johnson graphs
• Classification of edge-transitive rose window graphs
• scientific article; zbMATH DE number 5670906 (Why is no real title available?)
• scientific article; zbMATH DE number 11983 (Why is no real title available?)
• A NOTE ON THE TOTALLY TRANSITIVE GRAPH MAPS STABILITY OF PWL CELLULAR
• On automorphism group of a family of symmetric graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965970)