Journal of Computational Mathematica
https://shcpub.in/index.php/cm
Sacred Heart Research Publicationsen-USJournal of Computational Mathematica2456-8686Bivariate Optimal Replacement Policies under Partial Product Process for Multistate Degenerative Systems
https://shcpub.in/index.php/cm/article/view/449
<p>In this paper, we consider on a multistate degenerative system with k working states and <em>l</em>-failure states and study the maintenance problems under various bivariate replacement polices (<em>T, N</em>)<em>,</em>(<em>T </em>+<em>, N</em>)<em>,</em>(<em>U, N</em>)<em>,</em>(<em>U </em><em>−</em><em>, N</em>). 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.</p>Affan Ahmed JGovindaraju PRizwan UMohamed Ali A
Copyright (c) 2026
2026-01-132026-01-1310112410.26524/cm223Generalization of Product Cordial Magic and Super Mean Labeling on Three Dimensional Graph and its Applications
https://shcpub.in/index.php/cm/article/view/455
<p>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.</p>Sudhakar VUma Maheswari GVasanthkumar S USathinathan TBalaji V
Copyright (c) 2026
2026-06-302026-06-30101253810.26524/cm224AMGL Coding Technique on Felicitous Labeling of Braid Graphs and its Applications
https://shcpub.in/index.php/cm/article/view/458
<p>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.</p>Leena SSudhakar VNarayanan LNMalarvizhi VBalaji V
Copyright (c) 2026 Journal of Computational Mathematica
https://doi.org/10.26524/cm225
2026-04-292026-04-29101395610.26524/cm225