Multiple Kronecker covering graphs
From MaRDI portal
Abstract: A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon. Using this approach we show that the least common cover of two graphs need not be unique.
Recommendations
Cites work
- scientific article; zbMATH DE number 2133100 (Why is no real title available?)
- scientific article; zbMATH DE number 5077154 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 1550912 (Why is no real title available?)
- Finite common coverings of graphs
- Graphs of groups on surfaces. Interactions and models
- Hypercubes As Direct Products
- New geometries for finite groups and polytopes
- The Categorical Product of Graphs
Cited in
(9)- \(GI\)-graphs: a new class of graphs with many symmetries
- Neighborhood complexes and Kronecker double coverings
- Bipartite double cover and perfect 2-matching covered graph with its algorithm
- Generalized Petersen graphs and Kronecker covers
- Graphs whose Kronecker covers are bipartite Kneser graphs
- Characterization of generalised Petersen graphs that are Kronecker covers
- Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs
- scientific article; zbMATH DE number 5994660 (Why is no real title available?)
- Integral graphs obtained by dual Seidel switching
This page was built for publication: Multiple Kronecker covering graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925013)