Name
Abstract | ||
|---|---|---|
Given a combinatorial design D with block set B, its block-intersection graph G\"D is the graph having vertex set B such that two vertices b\"1 and b\"2 are adjacent if and only if b\"1 and b\"2 have non-empty intersection. In this paper, we prove that if D is a balanced incomplete block design, BIBD(v,k,@l), with arbitrary index @l, then G\"D contains a cycle of each length @?=3,4,...,|V(G\"D)|. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.disc.2003.11.033 | Discrete Mathematics |
Keywords | DocType | Volume |
block designs,block-intersection graphs,cycles of every length | Journal | 284 |
Issue | ISSN | Citations |
1-3 | Discrete Mathematics | 5 |
PageRank | References | Authors |
0.51 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Aygul Mamut | 1 | 31 | 3.92 |
| David A. Pike | 2 | 67 | 14.70 |
| Michael Raines | 3 | 31 | 4.70 |