Johnson graphs are panconnected

DOI10.1007/s12044-019-0527-3zbMath1420.05145arXiv1901.07207OpenAlexW2967872681WikidataQ127392173 ScholiaQ127392173MaRDI QIDQ2274796

S. Morteza Mirafzal, Akram Heidari

Publication date: 1 October 2019

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.07207

zbMATH Keywords

Johnson graphsquare of a graphpanconnected graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (5)

On the automorphism groups of connected bipartite irreducible graphs ⋮ Unnamed Item ⋮ Cayley properties of the line graphs induced by consecutive layers of the hypercube ⋮ \(L(n)\) graphs are vertex-pancyclic and Hamilton-connected ⋮ Some remarks on the square graph of the hypercube

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• The square of a block is Hamiltonian connected
• A new class of integral graphs constructed from the hypercube
• The automorphism group of the bipartite Kneser graph
• Johnson graphs are Hamilton-connected
• Connectivity of transitive graphs
• Bipartite Kneser graphs are Hamiltonian

This page was built for publication: Johnson graphs are panconnected