Composition of regular coverings of graphs and voltage assignments

نویسنده

  • Jana Siagiová
چکیده

Consider a composition of two regular coverings π1 : Γ0 → Γ1 and π2 : Γ1 → Γ2 of graphs, given by voltage assignments α1, α2 on Γ1, Γ2 in groups G1 and G2, respectively. In the case when π2 ◦ π1 is regular we present an explicit voltage assignment description of the composition in terms of G1, G2, α1, α2, and walks in Γ1.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coverings that preserve sense of direction

Sense of direction is a property of labelled networks (i.e., arc-coloured graphs) that allows one to assign coherently local identifiers to other processors on the basis of the route followed by incoming messages. We prove that (weak) sense of direction is preserved by the construction of regular coverings (i.e., coverings induced by voltage assignments in a group) whose voltage assignment depe...

متن کامل

L-functions of regular coverings of graphs

Let π1 : K H , π2 : H G and π2π1 : K G be three finite regular coverings of graphs, and let σ be a representation of the covering transformation group of π1. We show that the L-function of G associated to the representation of the covering transformation group of π2π1 induced from σ is equal to that of H associated to σ by means of ordinary voltage assignments. © 2003 Elsevier Science Ltd. All ...

متن کامل

Bipartite covering graphs

In this paper we study when a bipartite graph is a covering of a non-bipartite graph. We give a characterization of all coverings in terms of factoring the covering map through the canonical double covering. We also consider regular bipartite coverings described in terms of voltage assignments. We give an algebraic characterization of such coverings involving the subgroup generated by voltages ...

متن کامل

Critical groups of covering, voltage and signed graphs

Graph coverings are known to induce surjections of their critical groups. Here we describe the kernels of these morphisms in terms of data parametrizing the covering. Regular coverings are parametrized by voltage graphs, and the above kernel can be identified with a naturally defined voltage graph critical group. For double covers, the voltage graph is a signed graph, and the theory takes a par...

متن کامل

Coverings of Graphs and Maps, Orthogonality, and Eigenvectors

Lifts of graph and map automorphisms can be described in terms of voltage assignments that are, in a sense, compatible with the automorphisms. We show that compatibility of ordinary voltage assignments in Abelian groups is related to orthogonality in certain Z-modules. For cyclic groups, compatibility turns out to be equivalent with the existence of eigenvectors of certain matrices that are nat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Australasian J. Combinatorics

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2003