✦ LIBER ✦

The Clique Numbers of Regular Graphs

✍ Scribed by Narong Punnim

Publisher: Springer Japan
Year: 2002
Tongue: English
Weight: 84 KB
Volume: 18
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730200064

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Clique numbers of graphs

✍ Paul Erdös; Marcel Erné 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 337 KB

For each natural number n, denote by G(n) the set of all numbers c such that there exists a graph with exactly c cliques (i.e., complete subgraphs) and n vertices. We prove the asymptotic estimate Ia(n)l = 0(2"n -z/5) and show that all natural numbers between n + 1 and 2 "-6"5~6 belong to G(n). Thus

On antichain intersection numbers, total

On antichain intersection numbers, total clique covers and regular graphs

✍ Morimasa Tsuchiya 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 742 KB

In this paper, we consider total clique covers and intersection numbers on multifamilies. We determine the antichain intersection numbers of graphs in terms of total clique covers. From this result and some properties of intersection graphs on multifamilies, we determine the antichain intersection n

On clique covers and independence number

On clique covers and independence numbers of graphs

✍ Robert C. Brigham; Ronald D. Dutton 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 485 KB

The maximum number of cliques in dense g

The maximum number of cliques in dense graphs

✍ Bruce Hedman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Denote the number of vertices of G by ]G[. A clique of graph G is a maximal complete subgraph. The density oJ(G) is the number of vertices in the largest clique of G. If ¢o(G)>~½ ]GI, then G has at most 2 t°l-'cG) cliques. The extremal graphs are then examined as wen. ## Terminology We will be co

Dense graphs with small clique number

✍ Wayne Goddard; Jeremy Lyle 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB