Journal of Computational Mathematica

Bivariate Optimal Replacement Policies under Partial Product Process for Multistate Degenerative Systems

Affan Ahmed J, Govindaraju P, Rizwan U, Mohamed Ali A — Tue, 13 Jan 2026 00:00:00 +0000

In this paper, we consider on a multistate degenerative system with k working states and l-failure states and study the maintenance problems under various bivariate replacement polices (T, N),(T +, N),(U, N),(U −, N). The long-run average cost of a multistate degenerative system is calculated. Under the afore-mentioned bivariate replacement policies under partial product process optimality in inferred. In this study, the results developed are strengthened with numerical examples.

Generalization of Product Cordial Magic and Super Mean Labeling on Three Dimensional Graph and its Applications

Sudhakar V, Uma Maheswari G, Vasanthkumar S U, Sathinathan T, Balaji V — Tue, 30 Jun 2026 00:00:00 +0000

A Graphical representation of a graph are labeled by positive integers then the resultant graph is a r-regular graph. In this paper we introduce a product of two multi magic labeling on any r- regular graph and magic Petersen graph was introduced. Applications of magic Petersen graph and product of two multi magic labeling are also dealt in this research article.Well defined three dimensional cubic graphs are taken for initializing the new labeling called product of magic labeling.

AMGL Coding Technique on Felicitous Labeling of Braid Graphs and its Applications

Leena S, Sudhakar V, Narayanan LN, Malarvizhi V, Balaji V — Wed, 29 Apr 2026 00:00:00 +0000

Graph labeling plays a vital role in modern graph theory due to its wide range of applications in communications networks, cryptography, and coding theory. Among various labeling schemes, felicitous labeling is significant because of its modular arithmetic structure and uniqueness of edge labels. In this paper, the braid graph B(n) is studied under felicitous labeling and is further utilized for developing an efficient AMGL (Alphabets Maneuvered Graph Labeling) coding algorithm, and computational implementations are presented. Experimental results show that braid graphs provide a strong framework for secure message encoding and decoding. The study highlights the effectiveness of braid graphs in bridging mathematical theory with practical coding applications.