3-equitable prime cordial labeling : MATLAB techniques for analyzing cycle twin chord graphs
Salim Said Al Hudaifysalimsaid@squ.edu.omDepartment of Mathematics and Information TechnologyCentre for Preparatory StudiesSultan Qaboos UniversitySultanate of OmanView full profile → , Mohammad Al Natour Mohammad Al Natouralnatour@squ.edu.omDepartment of Mathematics and Information TechnologyCentre for Preparatory StudiesSultan Qaboos UniversitySultanate of OmanView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Jan 2026
- Published Online:
- 30 Sep 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2859
- Pages:
- 3419–3433
Abstract
Graph labeling methods are necessary in addressing complex matters in a Mobile Ad- Hoc Network (MANET) such as connectivity, scaling, routing, and modeling the network. We can make measurements reasonably confident by structuring networks in the form of graphs, by representing them using matrices and by considering mathematical graph theory as the foundational analytical basis. The management of the network will be automated by algorithms, whereas simulating the networks are basic elements of networks, node density, node mobility, and link formation as well as packet routing in relation to the random graph theory. The research of congestion analysis of MANETs can be analyzed using various algorithms, all of which initially dwell on the principles of the graph theory. In this paper, certain programming of MATLAB will be introduced to investigate how 3-equity prime cordial labeling acts in cycle graphs with twin chords, and hence it may clarify the intricate dynamics of a MANET.
Keywords
Subject Classifications
References
[1] S. Abhirami and R. Vikramaprasad, “MATLAB program for energy of even sum cordial graphs,” Int. J. Mech. Eng. Technol., vol. 9, no. 2, pp. 601–614 (2018).
[2] G. S. Bloom and S. W. Golomb, “Applications of numbered undirected graphs,” Proc. IEEE, vol. 65, no. 4, pp. 562–570 (1977), doi: 10.1109/PROC.1977.10517.
[3] R. Balakrishnan, “The energy of a graph,” Linear Algebra Appl., vol. 387, pp. 287–295 (2004), doi: 10.1016/j.laa.2004.02.038.
[4] R. Balakrishnan and K. Ranganathan, A Textbook of Graph Theory, 1st ed. New York, USA: Springer (2000), doi: 10.1007/978-1-4419-8505-7.
[5] J. A. Gallian, “A dynamic survey of graph labeling,” Electron. J. Combin., vol. 17, Dynamic Survey DS6 (2010).
[6] J. L. Gross and J. Yellen, Graph Theory and Its Applications, 2nd ed. Boca Raton, FL, USA: Chapman & Hall/CRC (2006).
[7] S. Gupta and S. Srivastav, “MATLAB algorithm for new results on energy of graphs,” Int. J. Comput. Sci. Inf. Secur., vol. 17, no. 3, pp. 14–17 (2019).
[8] R. Sweetly and J. Paulraj Joseph, “The radio number of graphs,” J. Discrete Math. Sci. Cryptogr., vol. 12, no. 6, pp. 729–736 (2009), doi: 10.1080/09720529.2009.10698268.
[9] R. Sweetly and J. Paulraj Joseph, “Radio number of graphs of diameter three,” J. Discrete Math. Sci. Cryptogr., vol. 10, no. 5, pp. 721–730 (2007), doi: 10.1080/09720529.2007.10698152.
[10] S. Leel, S. Srivastav, S. Gupta, and G. Ganesan, “Domination number in the context of some new graphs,” Eng. Proc., vol. 62, no. 1, p. 14 (2024), doi: 10.3390/engproc2024062014.
[11] P. Gupta, S. Gupta, and S. Srivastav, “Domination number for some STAR related graphs,” AIP Conf. Proc., vol. 3037, no. 1, Art. no. 020004 (2024), doi: 10.1063/5.0196045.
[12] S. Gupta and S. Srivastav, “Results with MATLAB coding of middle graph of cycle and its related graphs in context of sum divisor cordial,” Int. J. Emerg. Trends Eng. Res., vol. 8, no. 2, pp. 398–401 (2020), doi: 10.30534/ijeter/2020/26822020.
[13] F. Harary, Graph Theory, 3rd ed. Reading, MA, USA: Addison-Wesley (1972).
[14] A. Lourdusamy and F. Patrick, “Sum divisor cordial labeling for star and ladder related graphs,” Proyecciones J. Math., vol. 35, no. 4, pp. 437–455 (2016), doi: 10.4067/S0716-09172016000400006.
[15] S. Srivastav and S. Gupta, “Some more sum divisor cordial labelling of graphs,” Int. J. Comput. Sci. Inf. Secur., vol. 17, no. 4, pp. 143–145 (2019).
[16] S. J. Chapman, MATLAB Programming for Engineers. Stamford, CT, USA: Cengage Learning (2008).
