New families of graphs that have α-labelings
✍ Scribed by Hunter S. Snevily
- Book ID
- 103061479
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 444 KB
- Volume
- 170
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
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.
📜 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 The authors discuss a graph‐based approach for testing spatial point patterns. This approach falls under the category of data‐random graphs, which have been introduced and used for statistical pattern recognition in recent years. The authors address specifically the problem of testing c