Growth: A Journal of Mathematics and Mathematics Education
ISSN: xxxx-xxxx
Growth: A Journal of Mathematics and Mathematics Education aims to provide a publication platform for high quality undergraduate research in mathematics and in mathematical pedagogy. The technical scope of the journal is combinatorial mathematics, broadly interpreted—the editorial board will consider all submissions in their areas of interest. All submitted articles must have an undergraduate research component and must be certified by a senior researcher. All submissions will be peer reviewed according to standard practices in academic mathematics. Precise editorial policies are set by the editorial board.
- Research article
- Full Text
- Ars Combinatoria
- Volume 108
- Pages: 33-49
- Published: 31/01/2013
The study of chromatically unique graphs has been drawing much attention and many results are surveyed in \([4, 12, 13]\). The notion of adjoint polynomials of graphs was first introduced and applied to the study of the chromaticity of the complements of the graphs by Liu \([17]\) (see also \([4]\)). Two invariants for adjoint equivalent graphs that have been employed successfully to determine chromatic unique graphs were introduced by Liu \([17]\) and Dong et al. \([4]\) respectively. In the paper, we shall utilize, among other things, these two invariants to investigate the chromaticity of the complement of the tadpole graphs \(C_n(P_m)\), the graph obtained from a path \(P_m\) and a cycle \(C_n\) by identifying a pendant vertex of the path with a vertex of the cycle. Let \(\bar{G}\) stand for the complement of a graph \(G\). We prove the following results:
1. The graph \(\overline{{{C}_{n-1}(P_2)}}\) is chromatically unique if and only if \(n \neq 5, 7\).
2. Almost every \(\overline{{C_n(P_m)}}\) is not chromatically unique, where \(n \geq 4\) and \(m \geq 2\).
- Research article
- Full Text
- Ars Combinatoria
- Volume 108
- Pages: 23-31
- Published: 31/01/2013
An \(L(2,1)\)-labelling of a graph \(G\) is a function \(f\) from the vertex set \(V(G)\) to the set of all nonnegative integers such that \(|f(x) – f(y)| \geq 2\) if \(d(x,y) = 1\) and \(|f(x) – f(y)| \geq 1\) if \(d(x,y) = 2\), where \(d(x,y)\) denotes the distance between \(x\) and \(y\) in \(G\). The \((2,1)\)-labelling number \(\lambda(G)\) of \(G\) is the smallest number \(k\) such that \(G\) has an \(L(2,1)\)-labelling with \(\max\{f(v) : v \in V(G)\} = k\). Griggs and Yeh conjecture that \(\lambda(G) \leq \Delta^2\) for any simple graph with maximum degree \(\Delta \geq 2\). This article considers the graphs formed by the cartesian product of \(n\) (\(n \geq 2\) graphs. The new graph satisfies the above conjecture (with minor exceptions). Moreover, we generalize our results in [19].
- Research article
- Full Text
- Ars Combinatoria
- Volume 108
- Pages: 13-22
- Published: 31/01/2013
In this study, we first define new sequences named \((s, t)\)-Jacobsthal and \((s, t)\) Jacobsthal-Lucas sequences. After that, by using these sequences, we establish \((s, t)\)-Jacobsthal and \((s, t)\) Jacobsthal-Lucas matrix sequences. Finally, we present some important relationships between these matrix sequences.
- Research article
- Full Text
- Ars Combinatoria
- Volume 108
- Pages: 3-11
- Published: 31/01/2013
Several transformations about \(_\gamma F_6(1)\)-series are established by applying the modified Abel lemma on summation by parts. As a consequence, a reciprocal relation on balanced \(_3F_2(1)\)-series is derived, which may also be considered as a nonterminating extension of Saalschütz’s theorem (1891).
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 083
- Pages: 261-289
- Published: 30/11/2012
Let \( G \) be the one-point union of two cycles and suppose \( G \) has \( n \) edges. We show via various graph labelings that there exists a cyclic \( G \)-decomposition of \( K_{2nt+1} \) for every positive integer \( t \).
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 083
- Pages: 243-253
- Published: 30/11/2012
Recently Ozbal and Firat [22] introduced the notion of symmetric \( f \) bi-derivation of a lattice. They give illustrative examples and they also characterized the distributive lattice by symmetric \( f \) bi-derivation. In this paper, we define the isotone symmetric \( f \) bi-derivation and obtain some interesting results about isotoneness. We also provide the relations between distributive, modular, and isotone lattices through symmetric \( f \) bi-derivation.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 083
- Pages: 225-241
- Published: 30/11/2012
In 2003, Lee, Wang and Wen found a non-edge-magic simple connected cubic graph which satisfying the necessary condition of edge-magicness by using computer search. They asked for a mathematical proof. In this paper, we will provide such a proof.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 083
- Pages: 217-223
- Published: 30/11/2012
Let \( G \) be a graph and let \( f \) be a positive integer-valued function defined on \( V(G) \) such that \( 1 \leq a \leq f(x) \leq b \leq 2a \) for every \( x \in V(G) \). If \( t(G) \geq \frac{b^2}{a} \), \( |V(G)| \geq \frac{b^2}{a} + 1 \), and \( f(V(G)) \) is even, then \( G \) has an \( f \)-factor.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 083
- Pages: 211-216
- Published: 30/11/2012
A general construction for \( t \)-SB(\(2t-1\), \(2t-2\)) designs is given. In addition, large sets of \( t \)-SB(\(v\), \(k\)) are discussed and some examples are provided.
- Research article
- Full Text
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume 083
- Pages: 205-210
- Published: 30/11/2012
For a poset \( P = (X, \leq_P) \), the strict-double-bound graph (\(sDB\)-graph) of \( P = (X, \leq_P) \) is the graph \( sDB(P) \) on \( X \) for which vertices \( u \) and \( v \) of \( sDB(P) \) are adjacent if and only if \( u \neq v \) and there exist \( x \) and \( y \) in \( X \) distinct from \( u \) and \( v \) such that \( x \leq u \leq y \) and \( x \leq v \leq y \). The strict-double-bound number \( \zeta(G) \) is defined as
\[
\zeta(G) = \min \{ n \mid G \cup N_n \text{ is a strict-double-bound graph} \},
\]
where \( N_n \) is the graph with \( n \) vertices and no edges.
In this paper we deal with strict-double-bound numbers of some graphs. For example, we obtain that
\[
\zeta(P_n) = \lceil 2\sqrt{n-1} \rceil \text{ (} n \geq 2 \text{)},
\]
\[
\zeta(C_n) = \lceil 2\sqrt{n} \rceil \text{ (} n \geq 4 \text{)},
\]
\[
\zeta(W_n) = \lceil 2\sqrt{n-1} \rceil \text{ (} n \geq 5 \text{)},
\]
and
\[
\zeta(G + K_n) = \zeta(G)
\]
for a graph \( G \) with no isolated vertices.




