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.

J.P. Wang1,2, Q.X. Huang2, K.L. Teo3, F. Belardo4, R.Y. Liu1, C.F. Ye1
1Department of Mathematics and Information Science, Qinghai Normal University, Xining, Qinghai 810008, P.R. China
2College of Mathematics and System Science, Xinjiang University, Urumai, Xinjiang 830046, P.R. China
3Inst. of Fundamental Sciences, Massey University, Palmerston North, New Zealand
4Department of Mathematics, University of Messina, Italy
Abstract:

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\).

Zhendong Shao1, David Zhang2
1Department of Computer Science, The University of Western Ontario, London, ON, Canada.
2Department of Computing, Hong Kong Polytechnic University, Hong Kong.
Abstract:

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].

K. Uslu1, S. Uygun1
1 Department of Mathematics, Science Faculty, Selcuk University, 42075, Campus, Konya, Turkey
Abstract:

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.

Chenyin Wang1
1 National Science Foundation (Youth grant 10801026) and basic research foundation (S8111116001) of Nanjing University of In- formation Science and Technology (Nanjing, China).
Abstract:

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).

K. Brewington!1, R. C. Bunge2, L. J. Cross2, El- Zanati2, C. K. Pawlak2, J. L. Smith1, S. M. Zeppetello2
1Department of Mathematics, Computer Science & Physics Morehead State University Morehead, KY 40351
2Department of Mathematics Illinois State University Normal, IL 61790-4520
Abstract:

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 \).

Mustafa Asci1, Osman Kecilioglu2, Bijan Davvaz3
1Pamukkale University Science and Arts Faculty Department of Mathematics Denizli Turkey
2Kirikkale University Science And Arts Faculty Department Of Mathematics Kirikkale Turkey
3Yazd UNIVERSITY DEPARTMENT OF MATHEMATICS YAZD IRAN
Abstract:

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.

Wai Chee Shiu1
1Department of Mathematics, Hong Kong Baptist University, 224 Waterloo Road, Kowloon Tong, Hong Kong, China.
Abstract:

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.

Jiansheng Cai1
1School of Mathematics and information Sciences, Weifang University, Weifang 261061, P. R. China
Abstract:

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.

Hau Chan1, Derek W.Hein2, Dinesh G. Sarvate3
1Stony Brook University, Dept. or C. S., Srony Brook, NY, 11794
2SOUTHERN UTAH University, Dept. or MaTH., Cepar City, UT, 84720
3COLLEGE OF CHARLESTON, Dept. OF MATH., CHARLESTON, SC, 29424
Abstract:

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.

Shota Konishi1, Kenjiro Ogawa1, Satoshi Tagusari1, Morimasa Tsuchitya1
1Department of Mathematical Sciences, Tokai University Hiratsuka 259-1292, JAPAN
Abstract:

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.

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;