Research Article | Open Access
Farej Omer, Nabil Shalaby, "Starter Labelling of -Windmill Graphs with Small Defects", International Journal of Combinatorics, vol. 2015, Article ID 528083, 5 pages, 2015. https://doi.org/10.1155/2015/528083
Starter Labelling of -Windmill Graphs with Small Defects
A graph on vertices can be starter-labelled, if the vertices can be given labels from the nonzero elements of the additive group such that each label , either or , is assigned to exactly two vertices and the two vertices are separated by either edges or edges, respectively. Mendelsohn and Shalaby have introduced Skolem-labelled graphs and determined the conditions of -windmills to be Skolem-labelled. In this paper, we introduce starter-labelled graphs and obtain necessary and sufficient conditions for starter and minimum hooked starter labelling of all -windmills.
Consider as an additive abelian group of odd order . A starter in is a partition of the nonzero elements of into unordered pairs such that . Starters were first used by Stanton and Mullin to construct Room squares . Since then, starters have been widely used in several combinatorial designs such as Room cubes , Howell designs [3, 4], Kirkman triple systems , Kirkman squares and cubes [6, 7], Kotzig factorizations [8, 9], Hamilton path tournament designs , and optimal optical orthogonal codes . A starter sequence of order is an integer sequence; of integers such that, for every , we consider either or such that or , respectively, and if with then . When is the additive inverse of in and if the inverse appears in the sequence, we call it a defect. For example, the sequence is a starter sequence of order 3 with one defect in the group . We notice that Skolem sequences are a special case of starter sequences when the number of defects is zero. It is well known that Skolem sequences and their generalizations have been used widely to construct several designs such as Room squares, one-factorizations, and round robin tournaments. In 1991, Mendelsohn and Shalaby  introduced the concept of Skolem labelling and also provided the necessary and sufficient conditions for Skolem labelling of paths and cycles. Eight years later, Mendelsohn and Shalaby  determined the condition for the existence of Skolem labelling for -windmills. In 2008, Baker and Manzer  obtained the necessary conditions for the Skolem labelling of generalized -windmills in which the vanes need not be of the same length and proved that these conditions are sufficient in the case where . In this paper, we introduce the concept of starter labelling of graphs and explore the necessary and the sufficient conditions for the existence of starter and minimum hooked starter labelling of -windmills. Furthermore, we restate the definitions of starter and hooked starter-labelled graphs.
Definition 1. A starter-labelled graph is a pair , where(a) is an undirected graph,(b),(c) exactly once for each ,(d)if and then violates .
Definition 2. A hooked starter-labelled graph is a pair satisfying the conditions of Definition 1 with instated of :.
Example 3. Figure 1 illustrates a hooked starter-labelled graph for 4-windmills.
According to Definition 2, a hooked starter-labelled graph can have some vertices labelled zero, but every edge is still essential. This leads us to the definition of the strong (weak) starter-labelled graph.
Definition 4. A graph on vertices can be strongly starter-labelled if the removal of any edge destroys the starter labelling.
Definition 5. A graph on vertices can be weakly starter-labelled if there exists at least one edge in the graph such that the removal of that edge does not destroy the starter labelling.
Definition 7. A -windmill is a tree containing paths of equal positive length, called vanes, which share a center vertex called the pivot or the center.
We notice that a tree can only be starter-labelled if the number of the vertices is even . This implies that the length of the vane must be odd and that all -windmills where is even cannot be starter-labelled. In addition, an obvious degeneracy condition for a starter-label (a hooked starter-label) of a tree is that the tree must have a path of length at least . Thus, only 3-windmills can be starter-labelled.
2.1. Starter Parity
Mendelsohn and Shalaby  defined Skolem parity and proved that it was necessary for the existence of any Skolem-labelled tree. Similarly, we establish the parity condition for starter-labelled -windmills.
Definition 8. The starter parity of a vertex of a tree is the sum of the lengths of the paths from to all the vertices of the tree . Thus, (mod 2).
Lemma 9 (Mendelsohn and Shalaby ). If is a tree with vertices, then the starter parity of is independent of .
Lemma 10. If is a starter-label -windmill with vertices and vanes, then either(1) (mod 4), and the starter parity of is odd, or(2) (mod 4), and the starter parity of is even.
Proof. Assume that is a starter-label -windmill with vertices and vanes of length . Using the center point to calculate the starter parity, we obtainSince is starter-labelled, then and must be odd ; we notice that if . Similarly, if , then (by the transitivity). Now we consider all the following cases of :(1)If (mod 4), then the starter parity is odd.(2)If (mod 4), then the starter parity is even.(3)If (mod 4), then the starter parity is odd.(4)If (mod 4), then the starter parity is even.
2.2. The Degeneracy Condition
We saw that a graph with vertices must have at least a path of length in order to be starter-labelled. Therefore all windmills with more than 3 vanes cannot be labelled by a starter sequence. For a (possibly hooked) starter-label -windmill with equal vanes of length , the largest label is and the maximum number of edges in the corresponding path not used in any other path is and is covering all edges of 2 vanes. Also, labels that are bigger than must cover parts of 2 vanes. The label may cover the complete vane. Thus for all labels with the maximum number of edges covered is no more thanMoreover, the labels must cover at least one edge that is covered by another label, so the total number of edges for these labels is at mostTherefore, the maximum number of edges is ≤ (2) + (3) since the total number of edges in a -windmill is ; hence .
In this section, we provide and prove the sufficient conditions for obtaining the starter-label (minimum hooked starter label) for all -windmills, where is the number of the vanes; we count them arbitrarily (say counterclockwise) from 1 to . Let indicate the length of the vane of the windmill; then each vertex can be represented by a pair where is the number of the vane and is its distance from the center, and the center point is denoted by .
Lemma 11. All 3-windmills with (mod 8) have a starter labelling, except for the case .
Proof. The required construction is shown in Table 1, where and represent the two positions in the windmill of the label . We notice that the number of the defects is in case that (mod 8) and in case that (mod 8).
Lemma 12. For all 3-windmills with vane length (mod 8) there is a minimum hooked starter labelling with exactly one hook.
Proof. The solution is given by Table 2, where the number of the defects is .
All 4-windmills have an odd number of vertices, so there is no starter labelling. The minimum hooked starter labelling in this case has at least three hooks.
Lemma 13. All 4-windmills with have a minimum hooked starter labelling with exactly three hooks.
Proof. We divide the proof into two cases.
Case 1 ( is odd). The solution is given by Table 3.
Case 2 ( is even). The solution is given by Table 4.
Table 5 provides us with the construction of the pairs and for a weak starter labelling of 4-windmills.
Remark 14. We can construct a hooked starter labelling with zero defects (Skolem labelling) and one hook for all 4-windmills. Tables 6 and 7 provide such a required construction.
Case 1. (mod 2) is given by Table 6.
Case 2. (mod 2) is given by Table 7.
In this case there is no starter labelling; thus the only possibility is a minimum hooked starter labelling.
Lemma 15. For any -windmill, the condition is sufficient for a minimum hooked starter labelling.
Proof. Fix and consider separate cases for .
Case 1 (the number of vanes is even ). Label the vanes , and the solution is given by Table 8.
Case 2 (, ). Label the vanes . The required construction is shown in Table 9.
Case 3 (). Label the vanes . The required construction is demonstrated by Table 10.
4. Future Research
Open questions include(1)finding the necessary and sufficient conditions for starter labelling of trees,(2)finding the necessary and sufficient conditions for starter labelling of generalized -windmills, where .
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
- R. G. Stanton and R. C. Mullin, “Construction of Room squares,” Annals of Mathematical Statistics, vol. 39, pp. 1540–1548, 1968.
- J. H. Dinitz and D. R. Stinson, “The spectrum of Room cubes,” European Journal of Combinatorics, vol. 2, no. 3, pp. 221–230, 1981.
- B. A. Anderson and K. B. Gross, “Starter-adder methods in the construction of Howell designs,” Journal of the Australian Mathematical Society, vol. 24, no. 3, pp. 375–384, 1977.
- J. H. Dinitz and D. R. Stinson, “A note on Howell designs of odd side,” Utilitas Mathematica, vol. 18, pp. 207–216, 1980.
- D. R. Stinson and S. A. Vanstone, “Some nonisomorphic Kirkman triple systems of order 39 and 51,” Utilitas Mathematica, vol. 27, pp. 199–205, 1985.
- S. A. Vanstone and A. Rosa, “Starter-adder techniques for Kirkman squares and Kirkman cubes of small sides,” Ars Combinatoria, vol. 14, pp. 199–212, 1982.
- A. Rosa and S. A. Vanstone, “On the existence of strong Kirkman cubes of order 39 and block size 3,” Annals of Discrete Mathematics, vol. 26, pp. 309–320, 1985.
- C. J. Colbourn and E. Mendelsohn, “Kotzig factorizations existence and computational results,” Annals of Discrete Mathematics, vol. 12, pp. 65–78, 1982.
- J. D. Horton, “The construction of Kotzig factorizations,” Discrete Mathematics, vol. 43, no. 2-3, pp. 199–206, 1983.
- J. D. Horton, “Hamilton path tournament designs,” Ars Combinatoria, vol. 27, pp. 69–74, 1989.
- K. Chen, G. Ge, and L. Zhu, “Starters and related codes,” Journal of Statistical Planning and Inference, vol. 86, no. 2, pp. 379–395, 2000.
- E. Mendelsohn and N. Shalaby, “Skolem labelled graphs,” Discrete Mathematics, vol. 97, no. 1–3, pp. 301–317, 1991.
- E. Mendelsohn and N. Shalaby, “On Skolem labelling of windmills,” ARS Combinatoria, vol. 53, pp. 161–172, 1999.
- C. A. Baker and J. D. A. Manzer, “Skolem-labeling of generalized three-vane windmills,” Australasian Journal of Combinatorics, vol. 41, pp. 175–204, 2008.
Copyright © 2015 Farej Omer and Nabil Shalaby. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.