✦ LIBER ✦

Characterization of the graphs of the Johnson schemes G(3k, k) and G(3k + 1, k)

✍ Scribed by Aeryung Moon

Book ID: 107884154
Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 428 KB
Volume: 33
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(82)90040-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterization of k-variegated graphs,

Characterization of k-variegated graphs, k ⩾ 3

✍ Medha Javdekar 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 415 KB

On the uniqueness of the graphs G(n, k)

On the uniqueness of the graphs G(n, k) of the Johnson schemes

✍ Aeryung Moon 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 469 KB

The graphs G(n, k) of the Johnson Scheme

The graphs G(n, k) of the Johnson Schemes are unique for n ≥ 20

✍ Aeryung Moon 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 908 KB

A characterization of graphs G with G ≈

A characterization of graphs G with G ≈ K2(G)

✍ Chai-Ling Deng; Chong-Keang Lim 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 311 KB

A graph G is called a D-graph if for every set of cliques of G whose pairwise intersections are nonempty there is a vertex of G common to all the cliques of the set. A D-graph G is called a Dl-graph if it has the T 1 property: for any two distinct vertices x and y of G, there exist cliques C and D o

The Versatility of MMAP[K] and the MMAP[

The Versatility of MMAP[K] and the MMAP[K]/G[K]/1 Queue

✍ Qi-Ming HE 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 159 KB

On the Monotonicity of (k;g,h)-graphs

✍ Bao-guang Xu; Ping Wang; Jian-fang Wang 📂 Article 📅 2002 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 95 KB