𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tight Graphs and Their Primitive Idempotents

✍ Scribed by Arlene A. Pascasio

Book ID
110373461
Publisher
Springer
Year
1999
Tongue
English
Weight
71 KB
Volume
10
Category
Article
ISSN
0925-9899

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Normal Cayley Graphs and Hom-idempote
On Normal Cayley Graphs and Hom-idempotent Graphs
✍ Benoit Larose; FranΓ§ois Laviolette; Claude Tardif πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 218 KB

A graph G is said to be hom-idempotent if there is a homomorphism from G 2 to G, and weakly hom-idempotent if for some n β‰₯ 1 there is a homomorphism from G n+1 to G n . We characterize both classes of graphs in terms of a special class of Cayley graphs called normal Cayley graphs. This allows us to

On the Multiplicities of the Primitive I
On the Multiplicities of the Primitive Idempotents of a Q-Polynomial Distance-regular Graph
✍ Arlene A Pascasio πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 154 KB

and Terwilliger recently introduced the notion of a tridiagonal pair. We apply their results to distance-regular graphs and obtain the following theorem. THEOREM. Let denote a distance-regular graph with diameter D β‰₯ 3. Suppose is Q-polynomial with respect to the ordering E 0 , E 1 , . . . , E D of

Tight products and graph expansion
Tight products and graph expansion
✍ Amit Daniely; Nathan Linial πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 286 KB

## Abstract In this article, we study a new product of graphs called __tight product__. A graph __H__ is said to be a tight product of two (undirected multi) graphs __G__~1~ and __G__~2~, if __V__(__H__) = __V__(__G__~1~) Γ— __V__(__G__~2~) and both projection maps __V__(__H__)β†’__V__(__G__~1~) and _

Primitivity and ends of graphs
Primitivity and ends of graphs
✍ RΓΆgnvaldur G. MΓΆller πŸ“‚ Article πŸ“… 1994 πŸ› Springer-Verlag 🌐 English βš– 482 KB