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.

Akhilesh Jha1, Cini Varghese1, Eldho Varghese2, Mohd. Harun1, Seema Jaggi1, Arpan Bhowmik1
1ICAR-Indian Agricultural Statistics Research Institute, Library Avenue, Pusa, New Delhi, India — 110 012
2ICAR-Central Marine Fisheries Research Institute, Kochi, India – 682 018
Abstract:

A new series of four-associate class partially balanced incomplete block designs in two replications has been proposed. The blocks of these designs are of two different sizes. The blocks can be divided into two groups such that every treatment appears in each group exactly once, and any two blocks belonging to two different groups have a constant number of treatments in common, i.e., these designs are affine resolvable.

Faisal Susanto1, Rinovia Simanjuntak2, Edy Tri Baskoro2
1Doctoral Program of Mathematics, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia
2Combinatorial Mathematics Research Group, Faculty of Mathematics and Natural Sciences, Institut Teknologi Bandung, Indonesia Center for Research Collaboration on Graph Theory and Combinatorics, Indonesia
Abstract:

We initiate to study a \(D\)-irregular labeling, which generalizes both non-inclusive and inclusive \(d\)-distance irregular labeling of graphs. Let \(G=(V(G),E(G))\) be a graph, \(D\) a set of distances, and \(k\) a positive integer. A mapping \(\varphi\) from \(V(G)\) to the set of positive integers \(\{1,2,\dots,k\}\) is called a \(D\)-irregular \(k\)-labeling of \(G\) if every two distinct vertices have distinct weights, where the weight of a vertex \(x\) is defined as the sum of labels of vertices whose distance from \(x\) belongs to \(D\). The least integer \(k\) for which \(G\) admits a \(D\)-irregular labeling is the \(D\)-irregularity strength of \(G\) and denoted by \(\mathrm{s}_D(G)\). In this paper, we establish several fundamental properties on \(D\)-irregularity strength for arbitrary graphs. We also determine this parameter exactly for families of graphs with small diameter or small maximum degree.

Italo J. Dejter1
1University of Puerto Rico Rio Piedras, PR 00936-8377
Abstract:

Let \( 0<k\in\mathbb{Z} \). Let the star 2-set transposition graph \( ST^2_k \) be the \( (2k-1) \)-regular graph whose vertices are the \( 2k \)-strings on \( k \) symbols, each symbol repeated twice, with its edges given each by the transposition of the initial entry of one such \( 2k \)-string with any entry that contains a different symbol than that of the initial entry. The pancake 2-set transposition graph \( PC^2_k \) has the same vertex set of \( ST^2_k \) and its edges involving each the maximal product of concentric disjoint transpositions in any prefix of an endvertex string, including the external transposition being that of an edge of \( ST^2_k \). For \( 1<k\in\mathbb{Z} \), we show that \( ST^2_k \) and \( PC^2_k \), among other intermediate transposition graphs, have total colorings via \( 2k-1 \) colors. They, in turn, yield efficient dominating sets, or E-sets, of the vertex sets of \( ST^2_k \) and \( PC^2_k \), and partitions into \( 2k-1 \) such E-sets, generalizing Dejter-Serra work on E-sets in such graphs.

Yulin Kuang1, Yarui Zhu1, Qi Niu1
1School of General Education, Hunan University of Information Technology, Changsha 410151, Hunan, China
Abstract:

The scientific knowledge graph is an emerging research method in this context. In the research of physical education teaching, the research and sorting out of the research results of physical education teaching in my country from the perspective of scientometrics and information visualization is still slightly insufficient. The similarity between the frontiers of physical education teaching research in China and the United States in the past five years is that both countries have paid more attention to research topics such as physical education teaching methods and physical education courses. This paper proposes a rough set knowledge reduction algorithm based on improved genetic algorithm. The support and importance of conditional attributes to decision attributes are introduced into the information system, which are added to the genetic algorithm as heuristic information, and the concepts of population dissimilarity and individual dissimilarity are proposed to improve the genetic algorithm. The research on school physical education in my country is biased towards problem research, while the research on physical education teaching methods in the United States is biased towards student health; In addition, starting from the national conditions, the hotspots in the field of physical education teaching in my country tend to be “Sports and Health Curriculum Standards”, physical education teachers, physical education ideas, educational theories and college sports, while the hotspots in the field of physical education teaching in the United States tend to be physical activity, children and adolescents , students, women, exercise education, physical education, self-determination theory, and the integration of psychological motivation and physical education. Experimental data analysis my country’s physical education curriculum research should appropriately increase the attention to the details of physical education curriculum, and my country’s physical education teaching practice research should appropriately increase the research on physical education from the perspective of public health.

Mohamed Akdim1, Ahmed Drissi1
1National School for Applied Sciences (ENSA of Tangier), AbdelMalek Essaadi University, Tangier, Morocco
Abstract:

In secret sharing, the relationships between participants and the information they hold can be modeled effectively using graph structures. Graphs allow us to visualize and analyze these relationships, making it easier to define access structures, optimize share distributions, and ensure security. This paper provides the first comprehensive review of existing research on the application of graph theory to secret sharing comparing different classic and modern approaches and analyzing the current litterature. Through this study we highlight the key advances and methodologies that have been developed, underscoring the pivotal role of graph theoretic approaches in enhancing the security and efficiency of secret sharing schemes. Furthermore, the review identifies open challenges and future research directions, providing insights into potential innovations that could further strengthen cryptographic practices. This work serves as a foundational resource for researchers and practitioners seeking to deepen their understanding of the intersection between graph theory and secret sharing, fostering the development of more robust and sophisticated cryptographic solutions.

Sabitha Jose1, Sudev Naduvath1
1Department of Mathematics Christ University, Bangalore, India
Abstract:

A proper coloring assigns distinct colors to the adjacent vertices of a graph. An equitable near proper coloring of a graph \(G\) is an improper coloring in which neighbouring vertices are allowed to receive the same color such that the cardinalities of two distinct color classes differ by not more than one and the number of monochromatic edges is minimised by giving certain restrictions on the number of color classes that can have an edge between them. This paper discusses the equitable near proper coloring of line, middle, and total graphs of certain graph classes, such as paths, cycles, sunlet graphs, star graphs, and gear graphs.

Zhuang Xiong1, Yaoping Hou1
1College of Mathematics and Statistics, Hunan Normal University, small Changsha, Hunan 410081, China
Abstract:

This paper investigates the Turan-like problem for \(\mathcal{K}^-_{r + 1}\)-free \((r \geq 2)\) unbalanced signed graphs, where \(\mathcal{K}^-_{r + 1}\) is the set of unbalanced signed complete graphs with \(r+1\) vertices. The maximum number of edges and the maximum index for \(\mathcal{K}^-_{r + 1}\)-free unbalanced signed graphs are given. Moreover, the extremal \(\mathcal{K}^-_{r + 1}\)-free unbalanced signed graphs with the maximum index are characterized.

Bobin George1, Jinta Jose2, Rajesh K. Thumbakara3
1Department of Mathematics, Pavanatma College Murickassery, Kerala, India
2Department of Science and Humanities, Viswajyothi College of Engineering and Technology Vazhakulam, Kerala, India
3Department of Mathematics, Mar Athanasius College (Autonomous) Kothamangalam, Kerala, India
Abstract:

Directed hypergraphs represent a natural extension of directed graphs, while soft set theory provides a method for addressing vagueness and uncertainty. This paper introduces the notion of soft directed hypergraphs by integrating soft set principles into directed hypergraphs. Through parameterization, soft directed hypergraphs yield a sequence of relation descriptions derived from a directed hypergraph. Additionally, we present several operations for soft directed hypergraphs, including extended union, restricted union, extended intersection, and restricted intersection, and explore their characteristics.

Winfried Hochstättler1, Mehrdad Nasernejad2
1Fern Universität in Hagen, Fakultät für Mathematik und Informatik, 58084 Hagen, Germany
2Univ. Artois, UR 2462, Laboratoire de Mathématique de Lens (LML), F-62300 Lens, France
Abstract:

In this paper, we give a classification of all Mengerian \(4\)-uniform hypergraphs derived from graphs.

Rong Li1, Chaonan Liu2, Bei Li3
1School of Information Technology, Nanchang Vocational University, Nanchang, Jiangxi, 330050, China
2Hanyang Graduate School of International Studies, Hanyang University, Seoul, 04763, South Korea
3Wuhan Shangguan Information Technology Co., Ltd., Wuhan, Hubei, 430000, China
Abstract:

Big data technology makes it possible to scientifically analyse a large amount of marketing data, which plays an important role in the development of marketing strategies for products and the improvement of marketing effects. In this paper, a marketing data stream analysis system is designed based on the stream analysis method. The system designs and optimises the marketing data storage and retrieval, data acquisition and streaming calculation engine to achieve real-time user behaviour data streaming analysis. The average response time accuracy of the system’s data can reach 96%, the throughput rate is 11.8% ahead of the maximum compared to the Word Count system, and the before-and-after ratios of the PUSH message click rate, the user registration success rate, the online shop attention rate, the returning customer rate, and the loyal customer rate are 1.03, 1.02, 1.27, 1.11, 1.27, and 1.78, respectively. It indicates that this paper’s design of the marketing data streaming analysis system has good performance and application effect.

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;