𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On embedding well-separable graphs

✍ Scribed by Béla Csaba

Book ID
108113884
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
181 KB
Volume
308
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On separable self-complementary graphs
On separable self-complementary graphs
✍ Ken-ichi Kawarabayashi; Atsuhiro Nakamoto; Yoshiaki Oda; Katsuhiro Ota; Shinsei 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 65 KB
Algorithms on clique separable graphs
Algorithms on clique separable graphs
✍ Fǎnicǎ Gavril 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 925 KB

We define a family of graphs. tailed the clique sepambk graphs. characterized by the fact that they have completely connected rut sets by which we decompose them into r)arts such that when no further decomposition is possible we have a set of simple subgraphs. For example the chordal gmphs and the i

On the embedding of graphs into graphs w
On the embedding of graphs into graphs with few eigenvalues
✍ Vu, Van H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

A graph is called of type k if it is connected, regular, and has k distinct eigenvalues. For example graphs of type 2 are the complete graphs, while those of type 3 are the strongly regular graphs. We prove that for any positive integer n, every graph can be embedded in n cospectral, non-isomorphic