Journal of Applied and Pure Mathematics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지
DOI QR코드

DOI QR Code

ON HYPER G-MATRICES AND NETWORK MODELS IN COMMUNICATION SYSTEMS

  • HASAN KELES (Department of Mathematics, Karadeniz Technical University)
  • Received : 2025.09.16
  • Accepted : 2026.02.05
  • Published : 2026.03.30
Download PDF
⟨ Previous Next ⟩

Abstract

This paper explores the relationship between computer networks, communication systems, and a novel framework called Hyper G-matrices. We first describe how networks can be represented using adjacency, degree, and Laplacian matrices. We then generalize these representations to include networks with positive, negative, or absent interactions, which are relevant to communication and social systems. The connection between these structures and the framework of Hyper G-matrices, which capture matrix pairs related by diagonal transformations, provides new insights into how different representations of networks can be unified under a generalized algebraic framework. Furthermore, we discuss potential applications in network robustness, flow optimization, distributed computation, and quantum networks, and we analyze the spectral properties of these network matrices.

Keywords

Acknowledgement

We thank the editors, reviewers, and editorial office for their support.

References

  1. C. Altafini, Controllability and observability of linear systems on signed graphs, SIAM Journal on Control and Optimization 51 (2013), 696–724.
  2. N. Biggs, Algebraic Graph Theory, Second edition, Cambridge University Press, England, 1993.
  3. A. Brouwer, W. Haemers, Spectra of Graphs, Springer, 2011.
  4. F. Chung, Spectral Graph Theory, American Mathematical Society, 1997.
  5. C. Godsil, G. Royle, Algebraic Graph Theory, Springer, 2001.
  6. F. Harary, Graph Theory, Addison-Wesley, 1969.
  7. H. Kele¸s, On New Developments for Hyper G-Matrices, Equations 5 (2025), 23–28. https://doi.org/10.37394/232021
  8. J. Meng, S. Li, J. Wu, Signed graph theory for social network analysis: A review, Journal of Network and Computer Applications 197 (2022), 103244.
  9. T. Zaslavsky, Signed graphs, Handbook of Combinatorics 1 (2010), 317–380.
  10. F.J. Hall, Fundamental matrix of constrained minimization and generalized inverses of matrices, Ph.D. Dissertation, Carl D. Meyer adviser, North Carolina State University, 1973.
  11. F.J. Hall, K. Patel, M. Stewart, Interlacing Results on Matrices Associated with Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 68 (2009), 113–127.
  12. Kele¸s, H.´I. S¸ahin, On Conditional Propositions and Equivalence in Logical B3, International Journal of Applied Mathematics, Computational Science and Systems Engineering 7 (2025), 19–26. https://doi.org/10.37394/232026
  13. H. Keles, On The Basic Structure of Logic B3, In: Advanced Research in Mathematics, Technology, and Social Sciences, E. Islamoglu (ed.), BIDGE Publications, Ankara, 2024, 4-20.
  14. H. Kele¸s, On the Digits of Numbers in the System Logic B3, Journal of Applied and Pure Mathematics 6 (2024), 97–103.
  15. H. Kele¸s, On Some Logical Properties in B3, Journal of Applied Mathematics and Informatics 43 (2025), 267–275. https://doi.org/10.14317/JAMI.2025.267
  16. H. Kele¸s, F.J. Hall, On Properties Between G-matrices and Hyper G-matrices, Equations 75 (2025), 90-99. https://doi.org/10.37394/232021.2025.5.9
  17. H. Kele¸s, F.J. Hall, Further Structured Hyper G-matrix Pairs of Matrices, WSEAS Transactions on Mathematics 24 (2025), 714-725. https://doi.org/10.37394/23206.2025.24.71