✦ LIBER ✦

Isomorphisms ofP3-graphs

✍ Scribed by Li, Xueliang

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 324 KB
Volume: 21
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199601)21:1<81::aid-jgt11>3.0.co;2-v

No coin nor oath required. For personal study only.

✦ Synopsis

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 Whitney's result on line graphs.@ 1996 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

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

A characterization ofP4-indifference gra

A characterization ofP4-indifference graphs

✍ Ho�ng, Ch�nh T.; Maffray, Fr�d�ric; Noy, Marc 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 237 KB 👁 1 views

A graph is a P 4 -indifference graph if it admits a linear ordering ≺ on its vertices such that every chordless path with vertices a, b, c, d and edges ab, bc, cd has either a ≺ b ≺ c ≺ d or d ≺ c ≺ b ≺ a. P 4 -indifference graphs generalize indifference graphs and are perfectly orderable. We give a

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

Isomorphism criterion for monomial graph

Isomorphism criterion for monomial graphs

✍ Vasyl Dmytrenko; Felix Lazebnik; Raymond Viglione 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

## Abstract Let __q__ be a prime power, 𝔽~__q__~ be the field of __q__ elements, and __k__, __m__ be positive integers. A bipartite graph __G__ = __G~q~__(__k__, __m__) is defined as follows. The vertex set of __G__ is a union of two copies __P__ and __L__ of two‐dimensional vector spaces over 𝔽~__

Isomorphic Cayley graphs on nonisomorphi

Isomorphic Cayley graphs on nonisomorphic groups

✍ Morris, Joy 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 349 KB

The issue of when two Cayley digraphs on different abelian groups of prime power order can be isomorphic is examined. This had previously been determined by Anne Joseph for squares of primes; her results are extended.