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.

Margaret-Ellen Messinger1
1Dalhousie University, Halifax, Nova Scotia, Canada
Abstract:

A fire breaks out on a graph \( G \) and then \( f \) firefighters protect \( f \) vertices. At each subsequent interval, the fire spreads to all adjacent unprotected vertices, and firefighters protect \( f \) unburned vertices. Let \( f_G \) be the minimum number of firefighters needed to contain a fire on graph \( G \). If the triangular grid goes unprotected to time \( t = k \) when \( f_G \) firefighters arrive and begin protecting vertices, the fire can be contained by time \( t = 18k + 3 \) with at most \( 172k^2 + 58k + 5 \) vertices burned.

R.G. Stanton1
1Department of Computer Science University of Manitoba Winnipeg, MB, Canada R3T 2N2
Abstract:

A construction is given for a Restricted Sarvate-Beam Triple System in the case \( v = 8 \). This is the extremal case, since a Restricted SB Triple System cannot exist for \( v > 8 \).

Diya Bluskov1
1Department of Mathematics University of Northern BC Prince George, B.C. V2N 429 Canada
Abstract:

A \( t \)-\((v, k, \lambda) \) covering is a set of blocks of size \( k \) such that every \( t \)-subset of a set of \( v \) points is contained in at least \( \lambda \) blocks. The cardinality of the set of blocks is the size of the covering. The covering number \( C_\lambda(v, k, t) \) is the minimum size of a \( t \)-\((v, k, \lambda) \) covering. In this article, we find upper bounds on the size of \( t \)-\((v, k, 2) \) coverings for \( t = 3, 4 \), \( k = 5, 6 \), and \( v \leq 18 \). Twelve of these bounds are the exact covering numbers.

Arthur H.Busch1, Michael S.Jacobson1
1Department of Mathematics University of Colorado at Denver Denver, CO 80217
Abstract:

A tournament \(T = (V, A)\) is \({arc-traceable}\) if for each arc \(xy \in A\), \(xy\) lies on a directed path containing all the vertices of \(V\), i.e., a hamiltonian path. In this paper, we give two extremal results related to arc-traceability in tournaments. First, we show that a non-arc-traceable tournament \(T\) which is \(m\)-arc-strong must have at least \(2^{m+1}+4m-3\) vertices, and we construct an example that shows that this result is best possible. Next, we consider the maximum number of arcs in a strong tournament that are not part of any hamiltonian path. We use the structure of non-arc-traceable tournaments to prove that no strong tournament contains more than \(\frac{n^2-4n+3}{8}\) arcs that are not part of a hamiltonian path, and we give the unique example that shows that this bound is best possible.

Paola Biondi1, Pia Maria Lo Re1
1DIPARTIMENTO DI MATEMATICA E APPLICAZIONI, UNIVERSITA DI NAPOLI “FEDERICO II”, ITALY
Abstract:

Minimal blocking sets of class \([h,k]\) with respect to the external lines to an elliptic quadric of \(\text{PG}(3,q)\), \(q \geq 5\) prime, are characterized.

Bernie Martinelli1, Daniel Schaal2
1Mathematics Department Clarion University of Pennsylvania Clarion, PA, USA 16214
2Department of Mathematics and Statistics South Dakota State University Brookings, SD, USA 57007
Abstract:

For every integer \(c\) and every positive integer \(k\), let \(n = r(c, k)\) be the least integer, provided that it exists, such that for every coloring

\[\Delta: \{1,2,\ldots,n\} \rightarrow \{0,1\},\]

there exist three integers, \(x_1, x_2, x_3\), (not necessarily distinct) such that
\[\Delta(x_1) = \Delta(x_2) = \Delta(x_3)\]
and
\[x_1+x_2+c= kx_3.\]

If such an integer does not exist, then let \(r(c, k) = \infty\). The main result of this paper is that

\[r(c,2) =
\begin{cases}
|c|+1 & \text{if } c \text{ is even} \\
\infty & \text{if } c \text{ is odd}
\end{cases}\]

for every integer \(c\). In addition, a lower bound is found for \(r(c, k)\) for all integers \(c\) and positive integers \(k\) and linear upper and lower bounds are found for \(r(c, 3)\) for all positive integers \(c\).

Yang Yuansheng1, Xu Xirong1, Xi Yue1, Li Huijun1
1Department of Computer Science Dalian University of Technology Dalian, 116024, P. R. China
Abstract:

Let \(C_n\) denote the cycle with \(n\) vertices, and \(C_n^{(t)}\) denote the graphs consisting of \(t\) copies of \(C_n\) with a vertex in common. Koh et al. conjectured that \(C_n^{(t)}\) is graceful if and only if \(nt \equiv 0,3 \pmod 4\). The conjecture has been shown true for \(n = 3,5,6,7,4k\). In this paper, the conjecture is shown to be true for \(n = 9\).

E.Gokcen Kocer1
1Selcuk University, Faculty of Education 42099 Meram – Konya, Turkey
Abstract:

In this paper, we define the hyperbolic modified Pell functions by the modified Pell sequence and classical hyperbolic functions. Afterwards, we investigate the properties of the modified Pell functions.

Tomas Madaras1, Roman Sotak1
1Institute of Mathematics, Faculty of Sciences University of P. J. Safarik Jesennd 5, 041 54 Koiice, Slovak Republic
Abstract:

Deza and Grishukhin studied \(3\)-valent maps \(M_n{(p,q)}\) consisting of a ring of \(n\) \(g\)-gons whose inner and outer domains are filled by \(p\)-gons. They described the conditions for \(n, p, q\) under which such a map may exist and presented several infinite families of them. We extend their results by presenting several new maps concerning mainly large values of \(n\) and \(q\).

Ahmed Ainouche1
1CEREGMIA-GRIMAAG UAG-Campus de Schoelcher B.P. 7209 97275 Schoelcher Cedex Martinique (FRANCE)
Abstract:

A simple, undirected \(2\)-connected graph \(G\) of order \(n\) belongs to the class \(\mathcal{B}(n,\theta)\), \(\theta \geq 0\) if \(2(d(x) + d(y) + d(z)) \geq 3(n – 1 – \theta)\) holds for all independent triples \(\{x,y,z\}\) of vertices. It is known (Bondy’s theorem for \(2\)-connected graphs) that \(G\) is hamiltonian if \(\theta = 0\). In this paper we give a full characterization of graphs \(G\) in \(\mathcal{B}(n,\theta)\), \(\theta \leq 2\) in terms of their dual hamiltonian closure.

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;