Analysis of edge colorings and c¢(G) in discrete structures using graph theoretic approaches
Tanveer Ahmad Wanitanveer.ahmad@niu.edu.inDepartment of Physics Noida International UniversityNoida, Uttar Pradesh, 203201, DelhiView full profile → , *Pragati Patil BedekarCorresponding authorviceprincipal@tgpcet.comDepartment of Computer Science and Engineering Tulsiramji Gaikwad Patil College of Engineering and TechnologyNagpur, Maharashtra, 441108, IndiaView full profile → , Shital Rautshital.raut@vit.eduDepartment of Electronics and Telecommunication Vishwakarma Institute of TechnologyPune, Maharashtra, 411037, IndiaView full profile → , Tina Porwaltina.porwal@granthaalayah.comGranthaalayah Publications and PrintersIndore, Madhya Pradesh, 452005, IndiaView full profile → , M. Purnachandra Raopurnachandrarao@gmail.comDepartment of Information Technology KKR and KSR Institute of Technology and SciencesGuntur, Andhra Pradesh, 522017, IndiaView full profile → , B. N. Mallikharjuna Raoarjunarao01@gmail.comDepartment of Computer Science & Engineering KITS Akshar Institute of Technology Guntur, Andhra Pradesh, 522019, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 09 Apr 2025
- Published Online:
- 31 Dec 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2475
- Pages:
- 437–444
Abstract
Keywords
Subject Classifications
References
[1] E. Hurley, R. Joannis de Verclos, and R. J. Kang, “An improved procedure for coloring graphs of bounded local density,” Adv. Comb., pp. 7–33 (2022).
[2] G. Yu and R. Yu, “Strong edge-coloring of 2-degenerate graphs,” Discret. Appl. Math., vol. 336, pp. 11–14 (2023).
[3] Y. Wang, N. Song, J. Wang, and W. Wang, “The strong chromatic index of 1-planar graphs,” arXiv preprint, arXiv:2205.14680 (2022).
[4] A. Godbole, R. Dhabliya, V. Deshpande, S. A. Sivakumar, B. M. Shankar, and V. Khetani, “Ethical hacking and penetration testing strengthening cybersecurity posture through offensive security measures,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 4, pp. 1295–1305 (2024).
[5] M. Dȩbski, K. J. Szaniawski, and M. Ś. Nowak, “Strong chromatic index of K1,t-free graphs,” Discreet. Appl. Math., vol. 284, pp. 53–60 (2020).
[6] P. Mafuta, “Radius, diameter, domination number, order and minimum degree,” J. Inf. Optim. Sci., vol. 45, no. 5, pp. 1281–1291 (2024), doi: 10.47974/JIOS-1398.
[7] B. Albar and D. Gonçalves, “On triangles in Kr-minor free graphs,” J. Graph Theory, vol. 88, pp. 154–173 (2018).
[8] P. Siva, G. B. Pujitha, G. S. Krishna, G. Hemanth, and B. M. Sai Teja, “Smart surveillance systems using YOLOv8: A scalable approach for crowd and threat detection,” Int. J. Recent Adv. Eng. Technol., vol. 14, no. 1, pp. 51–62 (2025).
[9] W. C. Batenburg, R. Joannis de Verclos, R. J. Kang, and F. Pirot, “Strong chromatic index and Hadwiger number,” J. Graph Theory, vol. 100, pp. 435–457 (2022).
[10] S. Harsha, K. Aswini, G. Sahith, G. V. N. Abhiram, and D. B. Kumar, “Data integrity verification in images through SHA-based security,” Int. J. Adv. Comput. Eng. Commun. Technol., vol. 14, no. 1, pp. 92–102 (2025).
[11] Y. Chen, S. Fan, H. Lai, H. Song, and M. Xu, “Decomposition and r-hued coloring of K4(7)-minor free graphs,” Appl. Math. Comput., vol. 38, p. 125206 (2020).
[12] R. Balaji, R. B. Bapat, and S. Goel, “On distance matrices of wheel graphs with an odd number of vertices,” Linear Multilinear Algebra, vol. 70, pp. 3370–3401 (2022).
