✦ LIBER ✦

GENERALISED MAXIMAL INDEPENDENCE AND CLIQUE NUMBERS OF GRAPHS

✍ Scribed by Mynhardt, Christina M.

Book ID: 118191541
Publisher: Taylor and Francis Group
Year: 1988
Tongue: English
Weight: 372 KB
Volume: 11
Category: Article
ISSN: 1607-3606
DOI: 10.1080/16073606.1988.9632153

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Spectral bounds for the clique and indep

Spectral bounds for the clique and independence numbers of graphs

✍ Herbert S Wilf 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Laplacian spectral bounds for clique and

Laplacian spectral bounds for clique and independence numbers of graphs

✍ Mei Lu; Huiqing Liu; Feng Tian 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Chromatic numbers of layered graphs with

Chromatic numbers of layered graphs with a bounded maximal clique

✍ S. L. Berlov 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 349 KB

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

Clique transversal and clique independen

Clique transversal and clique independence on comparability graphs

✍ V. Balachandran; P. Nagavamsi; C.Pandu Rangan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 299 KB