๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Finite common coverings of graphs

โœ Scribed by Frank Thomson Leighton


Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
414 KB
Volume
33
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Zeta Functions of Finite Graphs and Cove
โœ H.M. Stark; A.A. Terras ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 691 KB

Galois theory for normal unramified coverings of finite irregular graphs (which may have multiedges and loops) is developed. Using Galois theory we provide a construction of intermediate coverings which generalizes the classical Cayley and Schreier graph constructions. Three different analogues of A

On the coverings of graphs
โœ F.R.K. Chung ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 383 KB
Automorphisms of graphs and coverings
โœ D.Zฬ† Djokoviฤ‡ ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 242 KB
Cycle and cocycle coverings of graphs
โœ Sean McGuinness ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 161 KB

In this article, we show that for any simple, bridgeless graph G on n vertices, there is a family C of at most n-1 cycles which cover the edges of G at least twice. A similar, dual result is also proven for cocycles namely: for any loopless graph G on n vertices and edges having cogirth g \* โ‰ฅ 3 and

Finite factor coverings of groups
โœ Oberta A Slotterbeck ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 378 KB