✦ LIBER ✦

Clustering with -regular graphs

✍ Scribed by Jong Kyoung Kim; Seungjin Choi

Book ID: 108234525
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 402 KB
Volume: 42
Category: Article
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2008.11.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random Graphs with Clustering

✍ Newman, M. E. J. 📂 Article 📅 2009 🏛 The American Physical Society 🌐 English ⚖ 147 KB

Distance-Regular Graphs with Strongly Re

Distance-Regular Graphs with Strongly Regular Subconstituents

✍ Anna Kasikova 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 87 KB

On graphs with regular groups

✍ Wilfried Imrich 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 466 KB

Regular graphs with excess one

✍ Eiichi Bannai; Tatsuro Ito 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 950 KB

Regular packings of regular graphs

✍ A. Gutiérrez; A.S. Lladó 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Regular factors in regular graphs

✍ P. Katerinis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274. Let G be a k-regular, (k -I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k -1. Then the graph obtained by removing any k -m edges of G, has an m-factor.