𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Identity Problem for Graph Products of Groups

✍ Scribed by Y.G. Baik; J. Howie; S.J. Pride


Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
288 KB
Volume
162
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


An edge coloring problem for graph produ
✍ Faudree, R. J.; GyοΏ½rfοΏ½s, AndrοΏ½as; Schelp, R. H. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 315 KB πŸ‘ 1 views

The edges of the Cartesian product of graphs G x H a r e to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H

Critical groups for complete multipartit
✍ Brian Jacobson; Andrew Niedermaier; Victor Reiner πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 147 KB

## Abstract The critical group of a connected graph is a finite abelian group, whose order is the number of spanning trees in the graph, and which is closely related to the graph Laplacian. Its group structure has been determined for relatively few classes of graphs, e.g., complete graphs and compl

The spectrum problem for the Petersen gr
✍ Adams, Peter; Bryant, Darryn E. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 305 KB πŸ‘ 2 views

It is shown that there exists a decomposition of K,, into edge-disjoint copies of the Petersen graph if and only if 'u = 1 or 10 (mod 151, 'u # 10.

Direct products of automorphism groups o
✍ Mariusz Grech πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 121 KB

## Abstract In this article we study the product action of the direct product of automorphism groups of graphs. We generalize the results of Watkins [J. Combin Theory 11 (1971), 95–104], Nowitz and Watkins [Monatsh. Math. 76 (1972), 168–171] and W. Imrich [Israel J. Math. 11 (1972), 258–264], and w

The Genus Problem for Cubic Graphs
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 206 KB

We prove that the following problem is NP-complete: Given a cubic graph G and a natural number g, is it possible to draw G on the sphere with g handles added?