Counting some finite-fold coverings of a graph
type: Item
instance of: scholarly article
title: Counting some finite-fold coverings of a graph
zbMATH Open document ID: 0776.05056
DOI: 10.1007/BF02349964
author: Jaeun Lee
author: Jin Ho Kwak
published in: Graphs and Combinatorics
publication date: 1993-01-16T00:00:00Z
review text: A graph \(\widetilde G\) is called a covering of the graph \(G\) with the projection \(p:\widetilde G\to G\) iff there is a surjection \(p:V(\widetilde G)\to V(G)\) such that \(p|_{N(\tilde v)}:N(\tilde v)\to N(v)\) is a bijection for any vertex \(v\in V(G)\) and \(\tilde v\in p^{-1}(v)\). If the covering projection \(p\) is \(n\)-to-one the covering is said to be \(n\)-fold. \textit{D. A. Waller} [Bull. Aust. Math. Soc. 14, 233-248 (1976; Zbl 0318.05113)] and \textit{M. Hofmeister} [J. Graph Theory 12, No. 3, 437-444 (1988; Zbl 0649.05036)] counted the number of isomorphism classes of double coverings of a given graph \(G\). Here the general case is investigated.
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 93443
zbMATH Keywords: covering of a graph
zbMATH Keywords: enumerations
zbMATH Keywords: isomorphism classes
reviewed by: R. C. Entringer
MaRDI profile type: Publication
cites work: Q3757929
cites work: Generating all graph coverings by permutation voltage assignments
cites work: Counting double covers of graphs
cites work: Double covers of graphs
Recommended article: Q4484777
Recommended article: Counting double covers of graphs
Recommended article: Enumeration of connected graph coverings
Recommended article: Q4871031
Recommended article: On total covers of graphs
Recommended article: On the graphoidal covering number of a graph
Recommended article: Q4510677
Recommended article: Covering numbers of regular multigraphs
Recommended article: Coverings of \(k\)-graphs
Recommended article: A note on the graphoidal covering number of a graph
description: scientific article; zbMATH DE number 93443