✦ LIBER ✦

A note on coset graphs

✍ Scribed by Ulrike Baumann

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 90 KB
Volume: 284
Category: Article
ISSN: 0025-584X
DOI: 10.1002/mana.200810093

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Coset graphs are a generalization of Cayley graphs. They arise in the construction of graphs and digraphs with transitive automorphism groups. Moreover, the consideration of coset graphs makes it possible to give an algebraic description of regular connected graphs of even degree. In this paper we consider the automorphism group of coset graphs with an edge set decomposed into oriented cycles and provide a characterization of subgroups of the automorphism group which preserve a given decomposition of the edge set. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim

📜 SIMILAR VOLUMES

A note on conservative graphs

✍ Arthur T. White 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

## Abstract An application of conservative graphs to topological graph theory is indicated.

A note on graphs spanned by Eulerian gra

A note on graphs spanned by Eulerian graphs

✍ W. R. Pulleyblank 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 1 views

## Abstract We show that the problem raised by Boesch, Suffel, and Tindell of determining whether or not a graph is spanned by an Eulerian subgraph is NP‐complete. We also note that there does exist a good algorithm for determining if a graph is spanned by a subgraph having positive even degree at

A note on regular Ramsey graphs

✍ Noga Alon; Sonny Ben-Shimon; Michael Krivelevich 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB

## Abstract We prove that there is an absolute constant __C__>0 so that for every natural __n__ there exists a triangle‐free __regular__ graph with no independent set of size at least \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle

A note on n-extendable graphs

✍ Qinglin Yu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract A graph __G__ having a perfect matching is called n‐__extendable__ if every matching of size __n__ of __G__ can be extended to a perfect matching. In this note, we show that if __G__ is an __n__‐extendable nonbipartite graph, then __G__ + __e__ is (__n__ ‐ 1)‐extendable for any edge e ϵ

A note on Ki-perfect graphs

✍ Jason I. Brown; Derek G. Corneil; A. Ridha Mahjoub 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB

## Abstract __Ki__‐perfect graphs are a special instance of __F ‐ G__ perfect graphs, where __F__ and __G__ are fixed graphs with __F__ a partial subgraph of __G.__ Given __S__, a collection of __G__‐subgraphs of graph __K__, an __F ‐ G__ cover of __S__ is a set of __T__ of __F__‐subgraphs of __K__

A note on generalized line graphs

✍ Peter J. Cameron 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 167 KB 👁 1 views

## Abstract Whitney's theorem on line graphs is extended to the class of generalized line graphs defined by Hoffman.