New families of adjointly unique graphs
β Scribed by Chengfu Ye; Xuewen Bao
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 296 KB
- Volume
- 172
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We apply symmetric balanced generalized weighing matrices with zero diagonal to construct four parametrically new infinite families of strongly regular graphs. Β© 2003 Wiley Periodicals, Inc. J Combin Designs 11: 208β217, 2003; Published online in Wiley InterScience (www.interscience.wil
## Abstract In this paper, it is proven that for each __k__ β₯ 2, __m__ β₯ 2, the graph Ξ~__k__~(__m,β¦,m__), which consists of __k__ disjoint paths of length __m__ with same ends is chromatically unique, and that for each __m, n__, 2 β€ __m__ β€ __n__, the complete bipartite graph __K__~__m,n__~ is chr
We give several new families of graphs that have ~-labelings. We also present some evidence to support the conjecture that every bipartite graph G eventually has an a-labeling.