✦ LIBER ✦

On the use of complete subgraphs in cluster analysis

✍ Scribed by J.C. Ogilvie; C.L. Olson

Book ID: 113161665
Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 866 KB
Volume: 1
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(72)90002-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the number of complete subgrap

Bounds on the number of complete subgraphs

✍ David C. Fisher; Jennifer Ryan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 385 KB

Fisher, D.C. and J. Ryan, Bounds on the number of complete subgraphs, Discrete Mathematics 103 (1992) 313-320. Let G be a graph with a clique number w. For 1 s s w, let k, be the number of complete j subgraphs on j nodes. We show that k,,, c (j~l)(kj/(~))u""'. This is exact for complete balanced w-

On the number of complete subgraphs cont

On the number of complete subgraphs contained in certain graphs

✍ R.J Evans; J.R Pulham; J Sheehan 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 255 KB

On the Number of Complete Subgraphs and

On the Number of Complete Subgraphs and Circuits in a Graph

✍ Larman, D. G. 📂 Article 📅 1969 🏛 The Royal Society 🌐 English ⚖ 510 KB

On the decomposition of a complete graph

On the decomposition of a complete graph into planar subgraphs

✍ Isao Shirakawa; Hiromitsu Takahashi; Hiroshi Ozaki 📂 Article 📅 1967 🏛 Elsevier Science 🌐 English ⚖ 692 KB

Ramsey problem on multiplicities of comp

Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs

✍ F. Franek; V. Rödl 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 461 KB

On the NP-completeness of the perfect ma

On the NP-completeness of the perfect matching free subgraph problem

✍ Mathieu Lacroix; A. Ridha Mahjoub; Sébastien Martin; Christophe Picouleau 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 231 KB