✦ LIBER ✦

Stable graphs for a family of endomorphisms

✍ Scribed by Norbert Polat

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 554 KB
Volume: 150
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00197-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Family of Almost Commuting Endomorp

On a Family of Almost Commuting Endomorphisms

✍ V.F.R. Jones 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 242 KB

If \(g_{i}\) is a central sequence of unitaries in a \(\mathrm{I}_{1}\) factor, we show that under certain circumstances \(\lim _{n \rightarrow x_{i}} \operatorname{Ad}\left(\prod_{i=1}^{n} g_{i}\right)\) is an automorphism. Examples come naturally from solutions of the Yang-Baxter equation with a s

A Family of Commutative Endomorphism Alg

A Family of Commutative Endomorphism Algebras

✍ F Okoh; F Zorzitto 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 318 KB

A new family of random graphs for testin

A new family of random graphs for testing spatial segregation

✍ Elvan Ceyhan; Carey E. Priebe; David J. Marchette 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 French ⚖ 382 KB

## Abstract The authors discuss a graph‐based approach for testing spatial point patterns. This approach falls under the category of data‐random graphs, which have been introduced and used for statistical pattern recognition in recent years. The authors address specifically the problem of testing c

Families of graphs complete for the stro

Families of graphs complete for the strong perfect graph Conjecture

✍ D. G. Corneil 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB 👁 1 views

The Strong Perfect Graph Conjecture states that a graph is perfect iff neither it nor its complement contains an odd chordless cycle of size greater than or equal to 5. In this article it is shown that many families of graphs are complete for this conjecture in the sense that the conjecture is true

Maximum internally stable sets of a grap

Maximum internally stable sets of a graph

✍ S.L Hakimi; H Frank 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 711 KB

A Splitter for Graphs with No Petersen F

A Splitter for Graphs with No Petersen Family Minor

✍ John Maharry 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 231 KB

The Petersen family consists of the seven graphs that can be obtained from the Petersen Graph by Y2-and 2Y-exchanges. A splitter for a family of graphs is a maximal 3-connected graph in the family. In this paper, a previously studied graph, Q 13, 3 , is shown to be a splitter for the set of all grap