✦ LIBER ✦

On 4-isomorphisms of graphs

✍ Scribed by G Lassmann

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 126 KB
Volume: 49
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90153-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Isomorphisms of Finite Cayley Graphs

✍ M. Conder; C. Heng Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 148 KB

A Cayley graph Cay(G, S) of a group G is called a CI-graph if whenever T is another subset of G for which Cay(G, S) ∼ = Cay(G, T ), there exists an automorphism σ of G such that S σ = T . For a positive integer m, the group G is said to have the m-CI property if all Cayley graphs of G of valency m a

Isomorphisms ofP3-graphs

✍ Li, Xueliang 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 324 KB

For graphs G and G' with minimum degree at least 3 and satisfying one of three other conditions, w e prove that any isomorphism from the &graph P3(G) onto P3(G') can be induced by a (vertex-) isomorphism of G onto G'. This in some sense can be viewed as a counterpart with respect to P3-graphs for Wh

On Isomorphisms of Connected Cayley Grap

On Isomorphisms of Connected Cayley Graphs, II

✍ Cai Heng Li 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 182 KB

A Cayley graph or digraph Cay(G, S) of a finite group G is called a CI-graph of G if, for any T/G, Cay(G, S)$Cay(G, T) if and only if S \_ =T for some \_ # Aut(G). We study the problem of determining which Cayley graphs and digraphs for a given group are CI-graphs. A finite group G is called a conne

P3-isomorphisms for graphs

✍ Aldred, R. E. L.; Ellingham, M. N.; Hemminger, R. L.; Jipsen, P. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 204 KB

The P 3 -graph of a finite simple graph G is the graph whose vertices are the 3-vertex paths of G, with adjacency between two such paths whenever their union is a 4-vertex path or a 3-cycle. In this paper we show that connected finite simple graphs G and H with isomorphic P 3 -graphs are either isom

On isomorphic factorizations of circulan

On isomorphic factorizations of circulant graphs

✍ Brian Alspach; Danny Dyer; Donald L. Kreher 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract We investigate the conjecture that every circulant graph __X__ admits a __k__‐isofactorization for every __k__ dividing |__E__(__X__)|. We obtain partial results with an emphasis on small values of __k__. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006

On the cycle-isomorphism of graphs

✍ Xingxing Yu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 336 KB

## Abstract This paper considers conditions ensuring that cycle‐isomorphic graphs are isomorphic. Graphs of connectivity ⩾ 2 that have no loops were studied in [2] and [4]. Here we characterize all graphs __G__ of connectivity 1 such that every graph that is cycle‐isomorphic to __G__ is also isomor