Fuzzy line graphs and their intuitionistic extension : Mathematical properties and applications
*Altaf Osman MulaniCorresponding authordraomulani.vlsi@gmail.comDepartment of Electronics & Telecommunication EngineeringSKN Sinhgad College of EngineeringPandharpur, Maharashtra, 413304, IndiaView full profile → , Kalyani R. Chaudharikalyani.chaudhari@bharatividyapeeth.eduDepartment of Electronics & Telecommunication EngineeringBharati Vidyapeeth’s College of Engineering for WomenPune, Maharashtra, 411043, IndiaView full profile → , Vidya Vijay Deshmukhvvdeshmukh@aissmscoe.comDepartment of Electronics & Telecommunication EngineeringAISSMS College of EngineeringPune, Maharashtra, 411001, IndiaView full profile → , Nandkishor Narkhedenandkishor.narkhede@sakec.ac.inDepartment of Electronics and Computer ScienceShah & Anchor Kutchhi Engineering CollegeChembur, Maharashtra, 400088, IndiaView full profile → , Vivian Brian Lobolobo.vivian27@gmail.comDepartment of Computer EngineeringDwarkadas J. Sanghvi College of EngineeringMumbai, Maharashtra, 400056, IndiaView full profile → , Pravin Ganpatrao Gawandepravin.gawande@vit.eduDepartment of Electronics and Telecommunication EngineeringVishwakarma Institute of TechnologyPune, Maharashtra, 411037, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Nov 2025
- Published Online:
- 30 Sep 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2777
- Pages:
- 3503–3512
Abstract
Fuzzy line graphs extend the classical line-graph construction so that edge adjacency is recorded as a graded membership value rather than a binary fact, and the resulting construction, together with its basic transformation and connectivity theory, was developed by Mohammad [1]. That framework, however, records only a single degree of confidence for each link and has no place for an explicit degree of doubt. Many of the systems it is meant to model—unreliable sensor links, contested survey data, roads whose condition reports conflict are more naturally described by an intuitionistic fuzzy graph, in which every vertex and edge carries both a membership degree and an independent non-membership degree, leaving a hesitation margin between them. This paper extends the fuzzy line graph construction of [1] to this intuitionistic setting. We define the intuitionistic fuzzy line graph (IFLG), prove that the construction is well defined and order-preserving in both the membership and the non-membership component, and prove that fuzzy connectivity is preserved under the extended construction. We then prove a Hesitation Interpolation Lemma, a result with no counterpart in the purely fuzzy case, showing that the hesitation degree of every edge produced by the construction lies between the hesitation degrees of the two edges it joins, so that uncertainty about a link is neither manufactured nor erased by the transformation. The framework is illustrated on a worked example and on a transportation network in which each road is assigned both a confidence and a doubt value, and the discussion compares the intuitionistic construction with its fuzzy predecessor, showing the fuzzy line graph to be the special case in which hesitation is uniformly zero.
Keywords
Subject Classifications
References
[1] S. I. Mohammad, “Fuzzy line graphs and their extensions: Mathematical properties and applications,” Int. J. Appl. Math., vol. 38, no. 7s, pp. 519–540 (2025), doi: 10.12732/ijam.v38i7s.498.
[2] L. A. Zadeh, “Fuzzy sets,” Inf. Control, vol. 8, no. 3, pp. 338–353 (Jun. 1965).
[3] A. Rosenfeld, “Fuzzy graphs,” in Fuzzy Sets and Their Applications to Cognitive and Decision Processes, L. A. Zadeh, K. S. Fu, K. Tanaka, and M. Shimura, Eds. New York, USA: Academic, pp. 77–95 (1975).
[4] K. T. Atanassov, “Intuitionistic fuzzy sets,” Fuzzy Sets Syst., vol. 20, no. 1, pp. 87–96 (Aug. 1986).
[5] R. Parvathi and M. G. Karunambigai, “Intuitionistic fuzzy graphs,” in Computational Intelligence, Theory and Applications, Advances in Soft Computing, vol. 38. Berlin, Germany: Springer, pp. 139–150 (2006), doi: 10.1007/3-540-34783-6_15.
[6] A. Shannon and K. T. Atanassov, “A first step to a theory of the intuitionistic fuzzy graphs,” in Proc. 1st Workshop Fuzzy Based Expert Syst., Sofia, Bulgaria, pp. 59–61 (Sep. 1994).
[7] J. N. Mordeson, “Fuzzy line graphs,” Pattern Recognit. Lett., vol. 14, no. 5, pp. 381–384 (May 1993).
[8] F. Harary, Graph Theory. Reading, MA, USA: Addison-Wesley (1969).
[9] H. Whitney, “Congruent graphs and the connectivity of graphs,” Amer. J. Math., vol. 54, no. 1, pp. 150–168 (Jan. 1932).
[10] J. N. Mordeson and P. S. Nair, Fuzzy Graphs and Fuzzy Hypergraphs, 2nd ed. Heidelberg, Germany: Physica-Verlag (2001).
[11] M. Akram and W. A. Dudek, “Intuitionistic fuzzy hypergraphs with applications,” Inf. Sci., vol. 218, pp. 182–193 (Jan. 2013).
[12] M. Akram, W. A. Dudek, and M. M. Yousaf, “Regularity in vague intersection graphs and vague line graphs,” Abstr. Appl. Anal., vol. 2014, Art. no. 525389 (2014).
[13] H. Bustince and P. Burillo, “Vague sets are intuitionistic fuzzy sets,” Fuzzy Sets Syst., vol. 79, no. 3, pp. 403–405 (May 1996).
[14] A. A. S. Mohammad, N. Yogeesh, S. I. S. Mohammad, N. Raja, Lingaraju, P. William, A. Vasudevan, N. Alshdaifat, and M. F. A. Hunitie, “An intuitionistic fuzzy graph model: Matrix representations and applications,” Cybern. Inf. Technol., vol. 25, no. 4, pp. 3–19 (2025), doi: 10.2478/cait-2025-0030.
[15] N. Nazir, T. Shaheen, L. Jin, and T. Senapati, “An improved algorithm for identification of dominating vertex set in intuitionistic fuzzy graphs,” Axioms, vol. 12, no. 3, Art. no. 289 (2023), doi: 10.3390/axioms12030289.
[16] K. R. Chaudhari, A. O. Mulani, M. P. Gajare, V. Jadhav, P. Yawle, and A. V. Bang, “Bit error rate analysis of various error correction codes with concatenated RS-convolutional codes,” J. Discrete Math. Sci. Cryptogr., vol. 29, no. 1, pp. 199–214 (2026).
[17] S. Salunkhe, A. O. Mulani, D. Shahane, M. Rana, S. M. Shukla, and M. M. Jadhav, “Secure image transmission using chaotic encryption and DWT watermarking on reconfigurable platform,” J. Discrete Math. Sci. Cryptogr., vol. 29, no. 1, pp. 349–361 (2026).
