✦ LIBER ✦

The Solution of a Problem of Godsil on Cubic Cayley Graphs

✍ Scribed by Cai Heng Li

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 267 KB
Volume: 72
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1997.1801

No coin nor oath required. For personal study only.

✦ Synopsis

In this short paper, we give a positive answer to a question of C. D. Godsil (1983, Europ. J. Combin. 4, 25 32) regarding automorphisms of cubic Cayley graphs of 2-groups: ``If Cay(G, S) is a cubic Cayley graph of a 2-group G and A=Aut Cay(G, S), does A 1 {1 imply Aut(G, S){1?'' 1998 Academic Press

📜 SIMILAR VOLUMES

On the Isomorphism Problem for Finite Ca

On the Isomorphism Problem for Finite Cayley Graphs of Bounded Valency

✍ C.H. Li; C.E. Praeger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 187 KB

For a subset S of a group G such that 1 / ∈ S and S = S -1 , the associated Cayley graph Cay(G, S) is the graph with vertex set G such that {x, y} is an edge if and only if yx -1 ∈ S. Each σ ∈ Aut(G) induces an isomorphism from Cay(G, S) to the Cayley graph Cay(G, S σ ). For a positive integer m, th

On the Isomorphisms of Cayley Graphs of

On the Isomorphisms of Cayley Graphs of Abelian Groups

✍ Yan-Quan Feng; Yan-Pei Liu; Ming-Yao Xu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 190 KB

Let G be a finite group, S a subset of G=f1g; and let Cay ðG; SÞ denote the Cayley digraph of G with respect to S: If, for any subset T of G=f1g; CayðG; SÞ ffi CayðG; T Þ implies that S a ¼ T for some a 2 AutðGÞ; then S is called a CI-subset. The group G is called a CIM-group if for any minimal gene

Regularities on the Cayley Graphs of Gro

Regularities on the Cayley Graphs of Groups of Linear Growth

✍ Roberto Incitti 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 197 KB

In this paper a short proof is given of a theorem of M . Gromov in a particular case using a combinatorial argument .

Exact solution of the centralized networ

Exact solution of the centralized network design problem on directed graphs

✍ Fatma Gzara; Jean-Louis Goffin 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

A note on shortest cycle covers of cubic

A note on shortest cycle covers of cubic graphs

✍ Xinmin Hou; Cun-Quan Zhang 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB 👁 1 views

## Abstract Let __SCC__~3~(__G__) be the length of a shortest 3‐cycle cover of a bridgeless cubic graph __G__. It is proved in this note that if __G__ contains no circuit of length 5 (an improvement of Jackson's (__JCTB 1994__) result: if __G__ has girth at least 7) and if all 5‐circuits of __G_

On the Number of 3-Edge Colorings of Cub

On the Number of 3-Edge Colorings of Cubic Graphs

✍ Christian Szegedy 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In this paper we present a short algebraic proof for a generalization of a formula of R. Penrose, Some applications of negative dimensional tensors, in: Combinatorial Mathematics and its Applications Welsh (ed.), Academic Press, 1971, pp. 221-244 on the number of 3-edge colorings of a plane cubic gr