✦ LIBER ✦

Locally C6 graphs are clique divergent

✍ Scribed by F. Larrión; V. Neumann-Lara

Book ID: 108316407
Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 119 KB
Volume: 215
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00233-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique Divergent Clockwork Graphs and Pa

Clique Divergent Clockwork Graphs and Partial Orders

✍ F. Larrión; V. Neumann-Lara; M.A. Pizana 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 242 KB

Clique divergent clockwork graphs and pa

Clique divergent clockwork graphs and partial orders

✍ F Larrión; V Neumann-Lara; M.A Pizaña 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 259 KB

Clique-transversal number of graphs whos

Clique-transversal number of graphs whose clique-graphs are trees

✍ Zuo-song Liang; Er-fang Shan 📂 Article 📅 2008 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 127 KB

Graphs which are locally Grassmann

✍ Richard Weiss 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 598 KB

Graphs which are locally a cube

✍ Dominique Buset 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 590 KB

We prove that there are exactly two connected graphs which are locally a cube: a graph on :I5 vertices which is the complement of the (3 x 5)-grid and a graph on 24 vertices which is the l-skeleton of a certain 4-dimensional regular polytope called the 24-cell.

The clique numbers of regular graphs of

The clique numbers of regular graphs of matrix algebras are finite

✍ S. Akbari; M. Jamaali; S.A. Seyed Fakhari 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 96 KB

Let F be a field, char(F) / = 2, and S ⊆ GL n (F), where n is a positive integer. In this paper we show that if for every distinct elements x, y ∈ S, x + y is singular, then S is finite. We conjecture that this result is true if one replaces field with a division ring.