๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A characterization of graphs G with 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

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