Analyzing Δ(G) and δ(G) in graph theory for improved network analysis algorithms
M. P. Sunilmp.sunil@jainuniversity.ac.inDepartment of Electronics and Communication EngineeringFaculty of Engineering and TechnologyJAIN (Deemed-to-be University)Karnataka, 562112, IndiaView full profile → , Deepak Suresh Asudanideepak.s.asudani@gmail.comDepartment of Computer Science and EngineeringNagpur Campus, Symbiosis International (Deemed University)Symbiosis Institute of TechnologyPune, Maharashtra, IndiaView full profile → , *Tanveer Ahmad WaniCorresponding authortanveer.ahmad@niu.edu.inDepartment of PhysicsNoida International UniversityGreater Noida, Uttar Pradesh, 203201, IndiaView full profile → , Husnabad Venkateswara Reddyh.venkateswarareddy@vardhaman.orgDepartment of Computer Science and EngineeringVardhaman College of EngineeringHyderabad, Telangana, 501218, IndiaView full profile → , M. Hanumantha Raomrao2@gmail.comDepartment of Computer Science and EngineeringKKR and KSR Institute of Technology and SciencesGuntur, Andhra Pradesh, 522017, IndiaView full profile → , K. Tirupathaiahtriparhaiahk@gmail.comDepartment of Electronics & Communication EngineeringKITS Akshar Institute of TechnologyGuntur, Andhra Pradesh, 522019, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 08 Apr 2025
- Published Online:
- 31 Dec 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2485
- Pages:
- 289–297
Abstract
Keywords
Subject Classifications
References
[1] A. Sanka and R. Cheung, “A systematic review of blockchain scalability: Issues, solutions, analysis and future research,” J. Netw. Comput. Appl., vol. 195, p. 103232 (2021).
[2] A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, pp. 509–512 (1999).
[3] D. Easley and J. Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly Connected World, vol. 1. Cambridge, UK: Cambridge Univ. Press (2010).
[4] A. Gangrade, B. Agrawal, S. Kumar, and A. Mansuri, “A study of applications of graph colouring in various fields,” Int. J. Stat. Appl. Math., vol. 7 (2022).
[5] A. Majeed and I. Rauf, “Graph theory: A comprehensive survey about graph theory applications in computer science and social networks,” Inventions, vol. 5, p. 10 (2020).
[6] H. Raza, S. K. Sharma, and M. Azeem, “On domatic number of some rotationally symmetric graphs,” J. Math., vol. 2023, p. 3816772 (2023).
[7] M. Gulhane and T. Sajana, “Integrating optimized ensemble learning and explainable AI for accurate heart disease diagnosis,” J. Inf. Optim. Sci., vol. 45, no. 8, pp. 2369–2378 (2024).
[8] A. El-Mesady and O. Bazighifan, “Construction of mutually orthogonal graph squares using novel product techniques,” J. Math., vol. 2022, p. 9722983 (2022).
[9] M. Patel and E. Reynolds, “Robotic perception and manipulation in unstructured environments,” Int. J. Mech. Eng. Robot., vol. 13, no. 1, pp. 16–22 (2025).
[10] X. Wang, X. Zha, W. Ni, R. P. Liu, Y. J. Guo, X. Niu, and K. Zheng, “Survey on blockchain for Internet of Things,” Comput. Commun., vol. 136, pp. 10–29 (2019).
[11] X. Hu, A. Islam, and T. Britz, “Bounds on the closeness centrality of a graph,” arXiv preprint, arXiv:2204.11283 (2022).
[12] Y. Shahsavari, K. Zhang, and C. Talhi, “Toward quantifying decentralization of blockchain networks with relay nodes,” Front. Blockchain, vol. 5, p. 812957 (2022).
[13] J. Roberts and J. Clarke, “Quantum computing for cryptanalysis: Breaking modern cryptographic protocols,” Int. J. Adv. Electr. Comput. Eng., vol. 13, no. 2, pp. 24–32 (2025).
[14] C. Ezeh, T. Ren, Z. Li, Y. Wang, and Y. Qu, “Multi-type node detection in network communities,” Entropy, vol. 21, pp. 1237 (2019).
