TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Hybrid ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Volume 29·Issue 1·January 2026·35 Articles

Volume 29, Issue 1

Articles

Open Access Research Article·pp. 1–13·Vol. 29, Issue 1Jan 2026

Computing new degree-based topological indices associated with the zero-divisor graphs of finite commutative rings

A. Karimi, Fateme Movahedi, S. M. Taheri

Published Online: 28 Jul 2025DOI: 10.47974/JDMSC-1864

In this paper: Consider a commutative ring ℜ. Let ℨ*(ℜ) denote the set of zero-divisors of ℜ\{0}. A zero-division graph, denoted by Γ(ℜ), is a graph interrelated with the ring ℜ, where the vertex set consists of the...

AbstractReferencesFull Text PDF (440 KB)Views: 319Downloads: 86Citations: 0
Open Access Research Article·pp. 15–33·Vol. 29, Issue 1Jan 2026

Analysis of degree-based topological indices through M-polynomial of metal trihalides

Zahid Raza, Juan LG Guirao

Published Online: 28 Jul 2025DOI: 10.47974/JDMSC-1872

In this paper: The progression of 2D novel, metal trihalides MX3, has been learned Dirac half-metallicity topological spintronic possessions because of their interest that are inherited magnetic processes reflected...

AbstractReferencesFull Text PDF (1.0 MB)Views: 167Downloads: 81Citations: 0
Open Access Research Article·pp. 35–47·Vol. 29, Issue 1Jan 2026

A study of a variant of neighborhood version of degree-based indices for trees

Nasrin Dehgardi

Published Online: 28 Jul 2025DOI: 10.47974/JDMSC-2065

In this paper: Recently, Mondal et al. introduced several new indices based on neighborhood degree sum of vertices, which received increasing research attention. In this paper, we consider a variant of these indices...

AbstractReferencesFull Text PDF (334 KB)Views: 220Downloads: 81Citations: 0
Open Access Research Article·pp. 49–64·Vol. 29, Issue 1Jan 2026

Graph Edge Hyper-Zagreb index : Applications and thermodynamic property predictions for linear acenes molecules

Zohreh Aliannejadi, Somayeh Shafiee Alamoti

Published Online: 26 Feb 2025DOI: 10.47974/JDMSC-2135

In this paper: This research explores the Edge Hyper-Zagreb index, a unique method of calculating graph indices by replacing vertex degrees with edge degrees. The edge degree is obtained by summing the degrees of th...

AbstractReferencesFull Text PDF (615 KB)Views: 200Downloads: 63Citations: 0
Open Access Research Article·pp. 77–86·Vol. 29, Issue 1Jan 2026

Enhancing secret sharing security : A verifiable hierarchical threshold model and cheating detection based on integer factorization

Ali Havasi, Massoud Hadian Dehkordi

Published Online: 28 Jul 2025DOI: 10.47974/JDMSC-2217

In this paper: Secret sharing is the sharing of a secret between n shareholders so that only predefined subsets can retrieve the secret and other subsets called unauthorized subsets can not access the secret. In sec...

AbstractReferencesFull Text PDF (435 KB)Views: 128Downloads: 59Citations: 0
Open Access Research Article·pp. 97–110·Vol. 29, Issue 1Jan 2026

Central edge metric dimension of joint graph

Moh. Affaf, Liliek Susilowati, Yayuk Wahyuni, Miswanto, Kamal Dliou

Published Online: 20 Nov 2025DOI: 10.47974/JDMSC-2294

In this paper: Assume that w is a non-trivial connected graph, with u and v representing its vertices and e = uv representing its edges. The shortest total length of the pathways connecting u and v in G is the dista...

AbstractReferencesFull Text PDF (401 KB)Views: 161Downloads: 85Citations: 0
Open Access Research Article·pp. 111–126·Vol. 29, Issue 1Jan 2026

Implementation of Blom’s key scheme using the (q,m)-Lucas-Pell sequences

Elahe Mehraban, T. Aaron Gulliver, Evren Hinçal

Published Online: 15 Jan 2026DOI: 10.47974/JDMSC-2296

In this paper: In this paper, we define new sequences using Lucas and Pell sequences. Then the (q, m)-Lucas-Pell sequence matrix is introduced and some interesting structural results are obtained. These sequences ar...

AbstractReferencesFull Text PDF (447 KB)Views: 102Downloads: 72Citations: 0
Open Access Research Article·pp. 127–137·Vol. 29, Issue 1Jan 2026

Algorithm for the fast generation of Latin squares

Carolin Hannusch, Roland Major, Marco Pavone

Published Online: 14 Aug 2025DOI: 10.47974/JDMSC-2306

In this paper: We introduce an algorithm for the fast generation of Latin squares. Considering Latin squares with n rows and columns, we introduce a map which maps one square to another one of opposite parity. This...

AbstractReferencesFull Text PDF (271 KB)Views: 250Downloads: 83Citations: 0
Open Access Research Article·pp. 139–153·Vol. 29, Issue 1Jan 2026

On purity of ideals of n-ary semigroups

Patchara Pornsurat, Pakorn Palakawong na Ayutthaya, Bundit Pibaljommee

Published Online: 14 Jan 2026DOI: 10.47974/JDMSC-2313

In this paper: We begin by defining interior ideals of n-ary semigroups, followed by the introduction of j-pure ideals and interior pure ideals within this algebraic framework. Subsequently, we provide characterizat...

AbstractReferencesFull Text PDF (397 KB)Views: 151Downloads: 69Citations: 0
Open Access Research Article·pp. 155–160·Vol. 29, Issue 1Jan 2026

Fully SP-acts

Samir M Saied, Iqbal A Omer

Published Online: 15 Jan 2026DOI: 10.47974/JDMSC-2318

In this paper: Purity is one of the important concepts in Algebra, which was studied by many others in Acts, modules, and groups. An K-K-subact B of K-act is SP-sub-act, if every a ∈ A and a ∉ B, there is a pure K-s...

AbstractReferencesFull Text PDF (443 KB)Views: 228Downloads: 65Citations: 0
Open Access Research Article·pp. 161–167·Vol. 29, Issue 1Jan 2026

On e*-singular lifting modules

Ali A. Kabban, Wasan Khalid

Published Online: 15 Jan 2026DOI: 10.47974/JDMSC-2319

In this paper: Any R-module G is named e*S-lifting module if each sub-module L of G, there is sub-module V of L such that G = V ⨁ D, where D ⊆ G and L ∩ D ≪e*S D. This work proposes to present characteristics and ex...

AbstractReferencesFull Text PDF (481 KB)Views: 114Downloads: 81Citations: 0
Open Access Research Article·pp. 169–178·Vol. 29, Issue 1Jan 2026

Implementation of localized frequency transform-based encryption for enhanced cybersecurity in communication networks

Mudit Chaturvedi, Shilpa Sharma, Gulrej Ahmed, Vaibhav Bhavnagar

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2533

In this paper: The paper presents the Integrated Cybersecurity Evaluation and Risk Mitigation Framework (ICERMF), which utilizes wavelet-based cryptographic transforms in conjunction with AES-256 encryption to enhan...

AbstractReferencesFull Text PDF (499 KB)Views: 147Downloads: 78Citations: 0
Open Access Research Article·pp. 179–184·Vol. 29, Issue 1Jan 2026

H-Pu-supplemented modules

Halah Qahtan Hamdi, Nuhad S. Al-Mothafar

Published Online: 15 Jan 2026DOI: 10.47974/JDMSC-2322

In this paper: In this work, we introduce the concept of a purely supplement submodule, also consider some properties of this idea, and investigate connections between purely supplement submodules and related ideas....

AbstractReferencesFull Text PDF (353 KB)Views: 102Downloads: 60Citations: 0
Open Access Research Article·pp. 185–191·Vol. 29, Issue 1Jan 2026

On  e* SS-small submodules and e* SS-hollow modules

Amer S. Abdulrahman, Wasan Khalid

Published Online: 15 Jan 2026DOI: 10.47974/JDMSC-2323

In this paper: The goal for this work is to submit a conception for e* S-essential small submodules along with e* SS-hollow modules as the popularization for singular small submodules and hollow modules, a few chara...

AbstractReferencesFull Text PDF (374 KB)Views: 134Downloads: 80Citations: 0
Open Access Research Article·pp. 193–198·Vol. 29, Issue 1Jan 2026

Right power integer Fibonacci matrix size 2×2 for digital signature scheme 

Abdalgabar K. Yahea, Ruma Kareem K. Ajeena

Published Online: 15 Jan 2026DOI: 10.47974/JDMSC-2324

In this paper: A new version of digital signature scheme (DSS) has been proposed in this work. This version has used a new concept of linear algebra which is called the integer matrix of Fibonacci numbers with size...

AbstractReferencesFull Text PDF (136 KB)Views: 113Downloads: 81Citations: 0
Open Access Research Article·pp. 199–214·Vol. 29, Issue 1Jan 2026

Bit error rate analysis of various error correction codes with concatenated RS-convolutional codes

Kalyani R. Chaudhari, Altaf O. Mulani, Milind P. Gajare, Vaishali Jadhav, Pranali Yawle, Arti Vasant Bang

Published Online: 13 Jan 2026DOI: 10.47974/JDMSC-2401

In this paper: This rapid expansion has driven the development and adoption of a wide variety of communication standards, creating a critical need for systems that are both robust and adaptable. One innovative solut...

AbstractReferencesFull Text PDF (1.2 MB)Views: 197Downloads: 87Citations: 0
Open Access Research Article·pp. 229–241·Vol. 29, Issue 1Jan 2026

ϒ – Constacyclic codes over a Frobenius ring and their application to find novel quantum codes

Pooja Soni, Manju Pruthi, Arun Kumar Yadav

Published Online: 30 Dec 2025DOI: 10.47974/JDMSC-2415

In this paper: In this work, we use the Hermitian technique to find novel Quantum error correcting codes (𝒬E𝒞𝒞’s) by Constacyclic codes (CCc’s) over the ring ℛ = ℱp2 [𝓊, 𝓋]/(𝓊3 – ω2 𝓊, 𝓋3 – ω2 𝓋), where p is a non-e...

AbstractReferencesFull Text PDF (609 KB)Views: 137Downloads: 65Citations: 0
Open Access Research Article·pp. 243–251·Vol. 29, Issue 1Jan 2026

Development of combinatorial algorithms based on the χ(G) chromatic number for graph coloring issues

Mayur Jakhete, Vimal Bibhu, Armaan Shaikh, Rupali Deshpande, V. Mounika, J. Mounika

Published Online: 15 Jan 2026DOI: 10.47974/JDMSC-2480

In this paper: Graph colouring is a combinatorial optimisation problem that colours each vertex such that no two close vertices have the same colour while using the fewest hues feasible. The chromatic number (χ(G))...

AbstractReferencesFull Text PDF (343 KB)Views: 237Downloads: 82Citations: 0
Open Access Research Article·pp. 253–260·Vol. 29, Issue 1Jan 2026

Km, n biclique coverings : A novel combinatorial approach to discrete structures in network analysis

Honganur Raju Manjunath, Syed Rashid Anwar, Kumari Shipra, Sumeet Kaur, P. Appireddy, K. Nagendra Prasad

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2481

In this paper: Bipartite covers simplify complicated network viewing by breaking the graph into two full subgraphs. Network analysis determines network structure using combinatorial methods. The concept of Km,n bicl...

AbstractReferencesFull Text PDF (420 KB)Views: 81Downloads: 69Citations: 0
Open Access Research Article·pp. 261–269·Vol. 29, Issue 1Jan 2026

Slime mould optimization-enhanced RSA (SMO-RSA) : A bio-inspired approach to secure data communication

Neha Sharma, Narendra Singh Yadav, Gaurav Agarwal, Jaweria Izhar

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2531

In this paper: This paper introduces Slime Mould Optimization-Enhanced RSA (SMO-RSA), a novel cryptographic algorithm that synergizes the RSA cryptosystem with the bio-inspired Slime Mould Algorithm (SMA) to address...

AbstractReferencesFull Text PDF (163 KB)Views: 125Downloads: 77Citations: 0
Open Access Research Article·pp. 271–279·Vol. 29, Issue 1Jan 2026

Employing the Erdős–Ko–Rado theorem to develop new techniques in combinatorial intersection theory

Sheela Hundekari, Sagarkumar S. Badhiye, Pallavi R. Rege, Budigi Prabhakar, K. Nagendra Prasad, S. Udaya Lakshmi

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2482

In this paper: The Erdūs–Ko–Rado (EKR) theorem is a renowned result in combinatorial mathematics. It tells a lot about cross-set groups. This study examines how the EKR theorem might inspire combinatorial intersecti...

AbstractReferencesFull Text PDF (496 KB)Views: 162Downloads: 82Citations: 0
Open Access Research Article·pp. 281–288·Vol. 29, Issue 1Jan 2026

Exploring discrete structures in planar graphs through Fáry’s theorem and its combinatorial implications

V Mamatha, Arjit Tomar, Anuradha V. Yenkikar, Smita Desai, M. V. S. Devi, G. Ramya Sree

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2484

In this paper: This study explores the discrete structures of planar graphs, focusing on Fáry’s Theorem and its combinatory consequences. According to Fáry’s Theorem, all planar graphs may be put in the plane usin...

AbstractReferencesFull Text PDF (619 KB)Views: 227Downloads: 102Citations: 0
Open Access Research Article·pp. 289–297·Vol. 29, Issue 1Jan 2026

Analyzing Δ(G) and δ(G) in graph theory for improved network analysis algorithms

M. P. Sunil, Deepak Suresh Asudani, Tanveer Ahmad Wani, Husnabad Venkateswara Reddy, M. Hanumantha Rao, K. Tirupathaiah

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2485

In this paper: Graph theory has long been used to study complicated networks by focusing on building components like the highest and lowest degrees (u03a6(G)). The strength, connection, and vulnerability of a networ...

AbstractReferencesFull Text PDF (502 KB)Views: 141Downloads: 87Citations: 0
Open Access Research Article·pp. 299–306·Vol. 29, Issue 1Jan 2026

Combinatorial applications of the Catalan numbers in structuring discrete mathematical models

Deepika Mallampati, Deepak Suresh Asudani, Yashwant Dongre, Yazdani Hasan, M. Khamar, R. Seshaiah

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2486

In this paper: Many discrete mathematics models emphasize the Catalan numbers, a series of natural integers important in combinatory. These numbers also appear in lattice routes, binary bushes, and create triangulat...

AbstractReferencesFull Text PDF (383 KB)Views: 237Downloads: 69Citations: 0
Open Access Research Article·pp. 307–315·Vol. 29, Issue 1Jan 2026

Utilizing line graph construction in combinatorial analysis for network optimization

Ashutosh Panchbhai, Tanya Singh, Vikas Kolekar, Kalyan Devappa Bamane, N. Jaya Bhagyam, Sorabh Lakhanpal

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2488

In this paper: This study examines how combinatorial analysis may address network optimization challenges via line graph creation. Line graphs, which can transform graphs, underpin graph theory. Points in a line gra...

AbstractReferencesFull Text PDF (458 KB)Views: 144Downloads: 80Citations: 0
Open Access Research Article·pp. 317–324·Vol. 29, Issue 1Jan 2026

FIG : Assessing the vulnerability of wireless networks to cryptanalysis attacks on elliptic curves

Mahejabi Khan, Ananya Sharma, Dimmita Nagajyothi, Veerendra Yadav, Mohammad Alamgir Hossain, R. Ramesh

Published Online: 30 Dec 2025DOI: 10.47974/JDMSC-2494

In this paper: Cryptanalysis-based ECC attacks now threaten wireless network security. ECC is often used in Wi-Fi conversation structures to securely transfer data since it works and is impermeable with smaller key...

AbstractReferencesFull Text PDF (305 KB)Views: 185Downloads: 74Citations: 0
Open Access Research Article·pp. 325–334·Vol. 29, Issue 1Jan 2026

Mathematical modeling and AI-based AVOA-RSA algorithm for secure data communication

Neha Sharma, Gaurav Agarwal, Jaweria Izhar

Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2530

In this paper: The increasing sophistication of cyber threats necessitates the development of more robust cryptographic systems. This paper introduces African Vulture Optimization-Enhanced RSA (AVO-RSA), a novel hyb...

AbstractReferencesFull Text PDF (158 KB)Views: 114Downloads: 78Citations: 0
Open Access Research Article·pp. 335–342·Vol. 29, Issue 1Jan 2026

Implementation of wireless sensor network using Laplacian matrices and discrete structures to enhance the data transmission

Chandrashekhar Patel, Linesh Raja, Shilpa Sharma, Alok Kumar Ansu

Published Online: 15 Jan 2026DOI: 10.47974/JDMSC-2532

In this paper: In the current era, the rapid growth of digital connected devices makes it essential to ensure that wireless sensor networks provide reliable, energy-efficient, and scalable communication. This resear...

AbstractReferencesFull Text PDF (477 KB)Views: 134Downloads: 70Citations: 0
Open Access Research Article·pp. 343–348·Vol. 29, Issue 1Jan 2026

A novel public key cryptosystem considering elliptic curve principles

Pauly J., Saju M I, Antony John E F, Renjith Varghese

Published Online: 27 Dec 2025DOI: 10.47974/JDMSC-2600

In this paper: The unique public key cryptosystem presented in this work is built on the fundamental concepts of elliptic curves. The proposed method aims to offer a versatile and efficient Public Key Cryptography (...

AbstractReferencesFull Text PDF (272 KB)Views: 144Downloads: 86Citations: 0
Open Access Research Article·pp. 349–361·Vol. 29, Issue 1Jan 2026

Secure image transmission using chaotic encryption and DWT watermarking on reconfigurable platform

Shweta Salunkhe, Altaf O. Mulani, Deepali Shahane, Manish Rana, Shivam Mahendra Shukla, Makarand M. Jadhav

Published Online: 13 Jan 2026DOI: 10.47974/JDMSC-2608

In this paper: With the exponential rise in digital image transmission across unsecured networks, ensuring image confidentiality and authenticity has become essential. Traditional cryptographic methods like AES prov...

AbstractReferencesFull Text PDF (599 KB)Views: 223Downloads: 82Citations: 0
Open Access Research Article·pp. 363–373·Vol. 29, Issue 1Jan 2026

All the cardinal numbers of ideals G-part of Q-algebras

Jörg Koppitz, Ananya Anantayasethi

Published Online: 15 Jan 2026DOI: 10.47974/JDMSC-2609

In this paper: A Q-algebra (ξ; *, 0) is a generalization of the concepts of BCK, BCI-algebras, introduced by Neggers et al. [1]. As for BCK, BCI-algebras, the concept ideal is defined for Q-algebras [1]. In this pap...

AbstractReferencesFull Text PDF (716 KB)Views: 93Downloads: 75Citations: 0
Open Access Research Article·pp. 375–396·Vol. 29, Issue 1Jan 2026

Sentiment analysis on social-media textual data using hybrid transformer and sequence models

Harihar Nath Verma, Sanjay Kumar Malik, Vanita Jain

Published Online: 15 Jan 2026DOI: 10.47974/JDMSC-2633

In this paper: Sentiment analysis has become an invaluable exercise on social media addressing the understanding of opinion and consumer behavior and trends. The system of informality and context richness against pl...

AbstractReferencesFull Text PDF (836 KB)Views: 158Downloads: 90Citations: 0