Multiple Kronecker covering graphs
From MaRDI portal
Publication:925013
DOI10.1016/J.EJC.2007.07.001zbMATH Open1168.05359arXivmath/0505135OpenAlexW1976774288MaRDI QIDQ925013FDOQ925013
Tomaž Pisanski, Wilfried Imrich
Publication date: 29 May 2008
Published in: European Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0505135
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hypercubes As Direct Products
- The Categorical Product of Graphs
- Finite common coverings of graphs
- Graphs of groups on surfaces. Interactions and models
- New geometries for finite groups and polytopes
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- \(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
- 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
- Title not available (Why is that?)
- 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)