Multiple Kronecker covering graphs

DOI10.1016/J.EJC.2007.07.001MaRDI QIDQ925013zbMATH OpenOpenAlexFDO

Authors Wilfried Imrich, Tomaž Pisanski

Publication date 29 May 2008

Published in European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Kronecker coverminimal regular common coversnon-unique common double covers

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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

• Graphs whose Kronecker covers are bipartite Kneser graphs
• Generalized Petersen graphs and Kronecker covers
• Independent and vertex covering number on Kronecker product of \(K_{m,n}\)
• Neighborhood complexes and Kronecker double coverings
• Circulant covers of trivalent circulants

Cites work

• Finite common coverings of graphs
• Graphs of groups on surfaces. Interactions and models
• 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?)
• Hypercubes As Direct Products
• New geometries for finite groups and polytopes
• The Categorical Product of Graphs

Cited in

(11)

• Eigenfunctions supports of minimum cardinality in cubical distance-regular graphs
• Integral graphs obtained by dual Seidel switching
• 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
• scientific article; zbMATH DE number 5994660 (Why is no real title available?)
• GI-graphs: a new class of graphs with many symmetries
• Generalized Petersen graphs and Kronecker covers
• Characterization of generalised Petersen graphs that are Kronecker covers
• Cubic graphs with no eigenvalues in the interval (-1,1)
• Structural and spectral properties of unitary Haar graphs

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)