×

Intuitionistic fuzzy graph morphological topology. (English) Zbl 1480.05109

Devaney, Robert L. (ed.) et al., Topological dynamics and topological data analysis. IWCTA 2018. Selected papers based on the presentations at the international workshop and conference on topology & applications, Kochi, India, December 9–11, 2018. Singapore: Springer. Springer Proc. Math. Stat. 350, 255-262 (2021).
Summary: In this paper, we define morphological topology (\(\mathcal{M} \)-topology) on intuitionistic fuzzy graph (IFG). We also define neighbourhood graph, continuity and isomorphism between \(\mathcal{M} \)-topologies.
For the entire collection see [Zbl 1477.37002].

MSC:

05C72 Fractional graph theory, fuzzy graph theory
54A40 Fuzzy topology
68U05 Computer graphics; computational geometry (digital and algorithmic aspects)
Full Text: DOI

References:

[1] N. Alsheri, M. Akram, Intuitionistic fuzzy planner graphs. Discrete Dyn. Nat. Soc. 2014, 9 p. Article ID 39782
[2] Atanassov, K., Intuitionistic Fuzzy Sets: Theory and Applications (1999), Heidelberg: Springer-Verlag, Heidelberg · Zbl 0939.03057 · doi:10.1007/978-3-7908-1870-3
[3] D. Baets, E. Kerre, M. Gadan, The fundamentals of fuzzy mathematical morphology Part 1: basic concepts. Int. J. General Syst. 23, 155-171 (1995) · Zbl 0845.68106
[4] Cagman, N.; Enginoglu, S.; Citak, F., Fuzzy soft set theory and its applications, Iraninan J. Fuzzy Syst., 8, 3, 137-147 (2001) · Zbl 1260.03094
[5] P.M. Dhanya, A. Sreekumar, M. Jathavedan, P.B. Ramkumar, Algebra of morphological dilation on intuitionistic fuzzy hypergraph IJSRSET 4(1) (2018) · Zbl 1426.05143
[6] P.M. Dhanya, A. Sreekumar, M. Jathavedan, P.B. Ramkumar, Document modeling and clustering using hypergraph, Int. J. Appl. Eng. Res. 12(10), 2127-2135 (2017), ISSN (0973-4562)
[7] H. Heijmans, L. Vincent, Graph morphology in image analysis. Mathematical Morphology in Image Processing (1992), pp. 171-203
[8] Joshy, KD, Introduction to General Topology (1992), Eastern Limited: Wiley, Eastern Limited
[9] Karunambigai, KG; Parvathi, R., Intuitionistic fuzzy graphs, J. Comput. Intell. Theory Appl., 20, 139-150 (2006)
[10] E. Melin, Digital geometry & Khalimsky space. Uppsala Dissert. Mathe. 54 (2008) · Zbl 1515.68017
[11] J.R. Munkres, Topology, 2nd edn. Pearson
[12] A. Nagoor Gani, S. Anupriya, Spilt domination on intuitionistic fuzzy graph, in Advanced in Computational Mathematics and its Applications (ACMA) Vol. 2(2) (2012), ISSN 2167-6356
[13] L. Najman, F. Meyer, A short tour of mathematical morphology on edge and vertex weighted graphs, Image Processing and Analysis with Graphs Theory and Practice, ed. by O. Lezoray, L. Grady, CRC Press (2012), pp. 141-174. Digital Imaging and Computer Vision. 9781439855072 · Zbl 1346.68235
[14] Najman, L.; Cousty, J., A Graph-Based Mathematical Morphology Reader (2014), USA: Elsevier, USA · doi:10.1016/j.patrec.2014.05.007
[15] Najman, L.; Talbot, H., Mathematical Morphology from theory to Applications (2008), USA: Wiley, USA · Zbl 1198.94012
[16] P.B. Ramkumar, A. Jacob, Morphology on intuitionistic fuzzy soft graphs. Int. J. Adv. Res. Trends Eng. Technol. 5(Spl. issue)
[17] Rosenfeld, A., Digital topology, American Mathe. Monthly, 86, 8, 621-630 (1979) · Zbl 0432.68061 · doi:10.1080/00029890.1979.11994873
[18] Serra, J., Image Analysis and Mathematical Morphology (1982), New York: Academic Press, New York · Zbl 0565.92001
[19] A.M. Shyla, T.K. Mathew Varkey, Intuitionistic fuzzy soft graph. Int. J. Fuzzy Mathe. Arch. (2016)
[20] Sunitha, P., An elementary introduction to intuitionistic fuzzy soft graphs, J. Math. Comput. Sci., 6, 4, 668-681 (2016)
[21] Vincent, L., Graphs and mathematical morphology, Signal Process, 16, 365-88 (1989) · doi:10.1016/0165-1684(89)90031-5
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.