We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion had previously been given for the number of bipartite Steinhaus graphs and we give two fascinating closed forms for this
Algebraic characterizations of regularity properties in bipartite graphs
✍ Scribed by Abiad, Aida; Dalfó, Cristina; Fiol, Miquel Àngel
- Book ID
- 120650436
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 407 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper we discuss isomorphic decompositions of regular bipartite graphs into trees and forests. We prove that: (1) there is a wide class of r-regular bipartite graphs that are decomposable into any tree of size r, (2) every r-regular bipartite graph decomposes into any double star of size r,
Let 1 denote a 2-homogeneous bipartite distance-regular graph with diameter D 3 and valency k 3. Assume that 1 is not isomorphic to a Hamming cube. Fix a vertex x of 1, and let T=T(x) denote the Terwilliger algebra of T with respect to x. We give three sets of generators for T, two of which satisfy