Scattering matrices of regular coverings of graphs

نویسندگان
چکیده

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

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

منابع مشابه

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 ...

متن کامل

Regular Embeddings of Canonical Double Coverings of Graphs

This paper addresses the question of determining, for a given graph G, all regular maps having G as their underlying graph, i.e., all embeddings of G in closed surfaces exhibiting the highest possible symmetry. We show that if G satisfies certain natural conditions, then all orientable regular embeddings of its canonical double covering, isomorphic to the tensor product G K2 , can be described ...

متن کامل

Composition of regular coverings of graphs and voltage assignments

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.

متن کامل

Path Coverings of Graphs and Height Characteristics of Matrices

Using graph theoretic techniques, it is shown that the height characteristic of a triangular matrix A majorizes the dual sequence of the sequence of differences of maximal cardinalities of singular k-paths in the graph G(A) of A and that in the generic case the height characteristic is equal to that dual sequence. The results on matrices are also used to prove a graph theoretic result on the du...

متن کامل

Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices

We study the minimum number of complete bipartite subgraphs needed to cover and partition the edges of a k-regular bigraph on 2n vertices. Bounds are determined on the minima of these numbers for fixed n and k. Exact values of the minima are found for all n and k 6 4. The same results hold for directed graphs. Equivalently, we have determined bounds on the minimum value of the Boolean and nonne...

متن کامل

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


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

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2010

ISSN: 0012-365X

DOI: 10.1016/j.disc.2009.09.009