TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover

Journal of Discrete Mathematical Sciences and Cryptography

(Since 1998)
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

CiteScore 2025: 2.7 (Q1)

Powered by:Powered by

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
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Discrete Mathematical Sciences and Cryptography
Open Access Research Article

Developing novel theorems in graph theory for computational algorithm enhancement

, , , , * ,

* Corresponding author · click or hover a name for details

pp. 905–912Vol. 29Issue 2-BFebruary 2026DOI: 10.47974/JDMSC-2541 Crossmark XML
Received:
08 Apr 2025
Published Online:
31 Dec 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2541
Pages:
905–912

Abstract

Graph theory has been a long time tool for the basis of efficient algorithms in many computational domains such as routing, social network analysis and optimization. Traditional methods, however, tend to process dense and complex graph structures and, therefore, add to the computational cost. The existing approaches rarely involve entropy-based insights to selectively collapse graphs without losing essential structural information. Filling in this gap, the current study proposes a new theoretical construct, i.e., the Graph Edge Entropy Theorem (GEET). The theorem assigns to each edge an amount of informational contribution, quantified using the entropy measures formed from the normalized weights, and allowing the pruning of the low-entropy edges before the execution of the algorithm. To authenticate the efficiency of GEET, the Bitcoin Alpha trust network dataset was used. Preprocessing steps taken were edge weight normalization, and conversion into undirected graphs through mutual trust aggregation. GEET was plugged into Dijkstra’s algorithm with the results being benchmarked against traditional and partially pruned graphs. Experimental results showed that GEET enhanced model had significantly reduced execution time and memory usage with high path accuracy. To be precise, it delivered 61% faster computation and reduced memory consumption by 47% as compared to the baseline with a small 0.8% in path accuracy deviation. These results support the applicability of the practical efficiency of entropy-based edge evaluation in the computational graph algorithms.

Keywords

Graph theoryEntropy-based pruningComputational efficiencyDijkstra’s algorithm

Subject Classifications

Primary 93A30Secondary 49K15

References

[1] S. D. Pasham, Graph-Based Algorithms for Optimizing Data Flow in Distributed Cloud Architectures, pp. 67–95 (2022).
[2] B. Zhao and G. Guo, “An encryption algorithm for user’s sensitive information resources in network database,” Journal of Interdisciplinary Mathematics, vol. 21, no. 5, pp. 1255–1260 (2018).
[3] T. Chapuis-Chkaiban, Z. Toffano, and B. Valiron, “On new PageRank computation methods using quantum computing,” Quantum Inf. Process., vol. 22, no. 3, pp. 138 (2023).
[4] C.C. Chou, “A closed-form general solution for the distance of point-to-ellipse in two dimensions,” Journal of Interdisciplinary Mathematics, vol. 22, no. 3, pp. 337–351 (2019).
[5] S. Santhanalakshmi, K. Sangeeta, and G. K. Patra, “Design of group key agreement protocol using neural key synchronization,” Journal of Interdisciplinary Mathematics, vol. 23, no. 2, pp. 435–451 (2020).
[6] R. Singh, N. Bhardwaj, and K. Alam, “Graph-based recommendation algorithm for personalized suggestions,” J. Discrete Math. Sci. Cryptogr., vol. 28, no. 3, pp. 931 (2025).
[7] T. Zhang, Q. Liao, D. Zhang, C. Zhang, J. Yan, R. Ngetich, J. Zhang, Z. Jin, and L. Li, “Predicting MCI to AD conversion using integrated sMRI and rs-fMRI: Machine learning and graph theory approach,” Front. Aging Neurosci., vol. 13 (2021).
[8] F. Shafiei Dizaji and M. Shafiei Dizaji, “Novel computational mathematical algorithms for structural optimization using graph-theoretical methods,” Eng. Comput., vol. 39, no. 6, pp. 2391–2423 (Jan. 2022).
[9] R. Yavari, Z. Smoqi, A. Riensche, B. Bevans, H. Kobir, H. Mendoza, H. Song, K. Cole, and P. Rao, “Part-scale thermal simulation of laser powder bed fusion using graph theory: Effect of thermal history on porosity, microstructure evolution, and recoater crash,” Mater. Des., vol. 204, pp. 109685 (2021).

Views: 99Downloads: 14Citations: 0