Journal of Combinatorial Mathematics and Combinatorial Computing

ISSN: 0835-3026 (print) 2817-576X (online)

The Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC) began its publishing journey in April 1987 and has since become a respected platform for advancing research in combinatorics and its applications.
Open Access: The journal follows the Diamond Open Access model—completely free for both authors and readers, with no article processing charges (APCs).
Publication Frequency: From 2024 onward, JCMCC publishes four issues annually—in March, June, September, and December.
Scope: JCMCC publishes research in combinatorial mathematics and combinatorial computing, as well as in artificial intelligence and its applications across diverse fields.
Indexing & Abstracting: The journal is indexed in MathSciNet, Zentralblatt MATH, and EBSCO, enhancing its visibility and scholarly impact within the international mathematics community.
Rapid Publication: Manuscripts are reviewed and processed efficiently, with accepted papers scheduled for prompt appearance in the next available issue.
Print & Online Editions: All issues are published in both print and online formats to serve the needs of a wide readership.

Ravindra Pawar1, Tarkeshwar Singh1, Himadri Mukherjee1, Jay Bagga2
1Department of Mathematics, BITS Pilani K K Birla Goa Campus, Goa, India
2Department of Computer Science, Ball State University, Indiana, USA
Abstract:

A positive integer \(k\) is called a magic constant if there is a graph \(G\) along with a bijective function \(f\) from \(V(G)\) to the first \(|V(G)|\) natural numbers such that the weight of the vertex \(w(v) = \sum_{uv \in E} f(u) = k\) for all \(v \in V\). It is known that all odd positive integers greater than or equal to \(3\) and the integer powers of \(2\), \(2^{t}\), \(t \geq 6\), are magic constants. In this paper, we characterize all positive integers that are magic constants and generate all distance magic graphs, up to isomorphism, of order up to \(10\).

Afeefa Maryam1, M. Tariq Rahim1, Fawad Hussain1
1Department of Mathematics, Abbattabad University of Science and Technology, Pakistan
Abstract:

The Radenković and Gutman conjecture establishes a relationship between the Laplacian eigenvalues of any tree \(T_n\), the star graph \(S_n\), and the path graph \(P_n\), i.e., \({LE}(P_n) \leq {LE}(T_n) \leq {LE}(S_n).\) In this paper, we prove this conjecture for a class of trees with \(n\) vertices and having diameter \(16\) to \(30\).

Tianyu Li1
1Carey Business School, Johns Hopkins University, District of Columbia, 20001, Washington, United States of America
Abstract:

To address large prediction errors in traditional risk assessment methods, the X-means clustering algorithm is utilized to segment financial product customers, combined with correlation strength analysis to understand customer behaviors and needs. Using the Hoteling model, a two-step pricing strategy is proposed, revealing that data product prices are inversely proportional to depreciation rate, timeliness, and customization degree, and deriving the platform’s optimal pricing strategy. A financial risk indicator system is developed using principal component analysis for systematic risk assessment. In call option pricing prediction, the model converges at Epoch=40, achieving a normalized predicted price of 0.154 (true value: 0.153). For put options, the model converges at Epoch=100, with a predicted normalized price of 0.146 (true value: 0.145). The results demonstrate the model’s accuracy in pricing prediction, providing effective support for real-time market risk monitoring and timely risk prevention.

Zongqi Ge1
1University of East London Singapore Campus, 069542, Singapore
Abstract:

This study develops a stereoscopic vision system using a two-camera calibration method and BP neural networks combined with genetic algorithms to measure precision component dimensions. Images are processed using edge detection and Hough transform algorithms, and a machine vision-based inspection model is constructed. Bearing components are used as the research object to detect dimensions, edges, geometric parameters, and loose components under six angles. Maximum measurement deviation is 0.04 mm, and edge detection results are clear and concise. Geometric parameter deviations remain within [-5%, 5%], achieving high recognition accuracy. The detection model’s classification accuracy is 97.49%, with verification accuracy at 98.01%. Comprehensive false detection and leakage rates are 1.03% and 0.46%, respectively. The model demonstrates superior detection performance across various angles for bearing components.

Kai Yao1, Chenxi Bao2, Zhaoying Fan3
1School of Education and Sports & Student Work Department, Qingyang, Longdong University, Qingyang, Gansu, 745000, China
2International School, Rattana Bundit University, Bangkok, 10240, Thailand
3Party and Government Office, Xi’an FanYi University, Xi’an, Shaanxi, 710000, China
Abstract:

This study explores how employee satisfaction moderates the relationship between corporate performance and innovative behavior using deep learning models: Autoencoder and restricted Boltzmann machines (RBM). The Autoencoder extracts key features for better analysis, while the RBM-based model analyzes the relationships among employee satisfaction, corporate performance, and innovative behavior. Results show a positive correlation between employee satisfaction and innovative behavior (0.460) and between innovative behavior and corporate performance (0.348). Regression analysis reveals that employee satisfaction indirectly impacts corporate performance through innovative behavior (impact: 0.10, t = 5.25). Differences in satisfaction, innovative behavior, and performance were observed across employee attributes. This study highlights the role of employee satisfaction in enhancing corporate performance and innovation, offering insights for human resource strategies.

Bing Lai1
1College of Fine Arts and Design, Guangxi College for Preschool Education, Nanning 530022, China
Abstract:

Special attention has been given to China’s socio-economic development, the gradual improvement of living standards, and the increasing emphasis on preschool education by families and society. However, this process is influenced by various factors, such as school conditions, family dynamics, teacher performance, and social influences, which negatively affect the quality of kindergarten brand image and learning outcomes. These challenges hinder the effective empowerment of children across different fields. To achieve the goals of kindergarten education, teachers should leverage the comprehensive nurturing value of labor education to maximize and optimize its educational impact. Kindergarten brand image evaluation is a critical component of early childhood education, helping educators and researchers assess its effectiveness and identify areas for development. This paper addresses the issues in China’s current kindergarten brand image evaluation practices and proposes an evaluation method based on the support vector mechanism (SVM) and component analysis to enhance evaluation quality. The proposed approach aims to improve the accuracy and reliability of kindergarten brand image assessments, contributing to the advancement of early childhood education.

Jerlinkasmir R1, Veninstine Vivik J.1
1Department of Mathematics, Karunya Institute of Technology and Sciences, Coimbatore-641 114, Tamil Nadu, India.
Abstract:

This research delves into the pathway energy framework for flower families, a class of simple connected graphs, whose path matrix \( P \) is constructed such that each entry \( P_{ij} \) quantifies the maximum number of vertex-disjoint paths. By analyzing the characteristic values of this matrix, we establish the pathway energy bounds specific to these flower graph families. Additionally, a comprehensive algorithm is developed to evaluate the time complexity across different flower family configurations, utilizing numerous trials to capture their average, maximum, and minimum computational behaviors. This analysis offers a comparative study of the structural intricacies that lead to increased computational complexity, highlighting which graph topologies tend to impose higher algorithmic challenges. The proposed method introduces a refined and adaptable approach, deepening the exploration of characteristic graph properties and their computational impact, thereby expanding the practical applications of these findings in graph theory.

Haonan Qian1, Xinye Zhao2, Aihua Lei2, Teng Yu3
1Department of Physical Education, Hanyang University, Seoul, 04763, Republic of Korea
2School of Primary Education, Huaihua Normal College, Huaihua, Hunan, 418000, China
3Sports Department, Hubei University of Automotive Technology, Shiyan, Hubei, 442002, China
Abstract:

This study investigates the impact of gamification teaching on students’ motivation in physical education using questionnaires, teaching experiments, and mathematical statistics. A gamified sports teaching model, grounded in the self-determination motivation theory and analyzed through a multiple regression model, was designed to assess motivational stimulation. Results showed that gamified physical education significantly improved motivation in the experimental class compared to the control class (P < 0.05). The average physical education score in the experimental class was 77.67, 5.08 points higher than the control class. Internal motivation, identity regulation, intake regulation, and external regulation ratings were 4.132, 3.992, 4.172, and 4.156, respectively. Regression analysis confirmed that gamified teaching positively influenced motivation, with self-determination theory effectively mediating students’ physical education learning motivation.

Songlin Tong1, Meiling Liu1, Jiyun Zhou2
1School of Information and Computer Engineering, Northeast Forestry University, Harbin, Heilongjiang, 150080, China
2Lieber Institute, Johns Hopkins University, Baltimore, 999039, USA
Abstract:

Generative adversarial network (GAN) technology has enabled the automatic synthesis of realistic face images from text. This paper proposes a model for generating face images from Chinese text by integrating a text mapping module with the StyleGAN generator. The text mapping module utilizes the CLIP model for pre-training Chinese text, employs a convolutional-inverse convolutional structure to enhance feature extraction, and incorporates a BiLSTM model to construct complete sentences as inputs for the StyleGAN generator. The generator interprets semantic features to generate face images. Validation on Face2Text and COCO datasets yields F1 values of 83.43% and 84.97%, respectively, while achieving the lowest FID and FSD scores of 103.25 and 1.26. The combination of CLIP pre-training and word-level semantic embedding improves image quality, offering a novel approach for face recognition applications in public safety.

Yixian Wen1
1School of Business, Hunan Institute of Technology, Hengyang 412002, China
Abstract:

The promotion of industrial digital transformation is a crucial breakthrough in the evolution of economic structures and the physical layout of spaces. It has the potential to elevate the entire industrial chain to a high-end value chain, creating more profit opportunities and enhancing the influence of domestic industries in the international cycle. This study uses the cities in the Yangtze River Delta Economic Belt as a case study to explore the spatial effects of digital transformation on the healthy transformation of traditional industrial structures. It constructs relevant spatial coupling models and empirically verifies them by testing specific assumptions. The experimental results indicate that the model is significant at a level greater than 5%, making it suitable for selecting spatial measurement models. The mean square error of its network simulation output is 0.1333, confirming the expected hypothesis and demonstrating that digital transformation has a significant spatial driving effect on industrial upgrading.

E-mail Alert

Add your e-mail address to receive upcoming issues of Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC).

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;