Identification of fuzzy blocks using sum distance metric
Pages 5203 - 5211
Abstract
— In this paper, new concepts are introduced to enhance the process of block identification in fuzzy graphs using sum distance metric and special type of cycles, which is called a strongest strong cycle, locamin cycle. An Algorithm is developed for retrieving information from Big-Data using block identification.
References
[1]
Akram M., Karunambigai M.G., Metric in bipolar fuzzy graphs, World Appl. Sci. J. 14(12) (2011), 1920–1927.
[2]
Akram M., Dudek W.A., Regular bipolar fuzzy graphs, Neural Comput. Appl 21 (2012), 197–205.
[3]
Akram M., Interval-valued fuzzy line graphs, Neural Comput. Appl 21 (2012), 145–150.
[4]
Banerjee, Saibal, An optimal algorithm to find the degrees of connectedness in an undirected edge-weighted graph, Pattern Recognition Letters 12 (1991), 421–424.
[5]
Bhattacharya P., Suraweera F., An algorithm to compute the max-min powers and a property of fuzzy graphs, Pattern Recognit. Lett. 12 (1991), 413–420.
[6]
Bhutani K.R., and Rosenfeld A, Fuzzy end nodes in fuzzy graphs, Inf. Sci. 152 (2003), 323–326.
[7]
Bhutani K.R., On automorphisms of fuzzy graphs, Pattern Recognit. Lett. 9 (1989), 159–162.
[8]
Bhutani K.R., and Rosenfeld A, Strong arcs in fuzzy graphs, Inf. Sci. 152 (2003), 319–322.
[9]
Ghorai G., and Pal, Madhumangal, On degrees of m-polar fuzzy graphs with application, Journal of Uncertain Systems 11 (2017), 294–305.
[10]
Harary F., Graph Theory, 3rd ed. Reading, MA, USA: Addison-Wesley, 1972.
[11]
Mathew S., Anjali N., On blocks and stars in fuzzy graphs, Journal of Intelligent & Fuzzy Systems 28 (2015), 1659–1665.
[12]
Mathew S., Sunitha M.S., Bonds in graphs and fuzzy graphs, Adv. Fuzzy Sets Syst. 6(2) (2010), 107–119.
[13]
Mathew S., Sunitha M.S., Types of arcs in a fuzzy graph, Inf. Sci. 179(11) (2009), 1760–1768.
[14]
Mathew S., Sunitha M.S., A characterization of blocks in fuzzy graphs, J. Fuzzy Math. 19(1) (2011), 999–1006.
[15]
Mathew S., Sunitha M.S., Strongest strong cycles and θ-fuzzy graphs, IEEE Transactions on Fuzzy Systems 21(6) (2013), 1096–1104.
[16]
Mordeson J.N., Nair P.S., Arc disjoint fuzzy graphs, in Proc. 18th Int. Conf. North Amer. Fuzzy Inf. Process. Soc., 1999, pp. 65–69.
[17]
Mordeson J.N., Nair P.S., Fuzzy Graphs and Fuzzy Hypergraphs New York, NY, USA: Physica-Verlag, 2000.
[18]
Sarwar M., Akram M., An algorithm for computing certain metrics in intuitionistic fuzzy graphs, Journal of Intelligent & Fuzzy Systems 30 (2016), 2405–2416.
[19]
Rosenfeld A., Fuzzy graphs, Fuzzy Sets and Their Applications to Cognitive and Decision Processes. Zadeh L.A. et al., Eds., New York, NY, USA, Academic, 1975, pp. 77–95 .
[20]
Sunitha M.S., Vijayakumar A., A characterization of fuzzy trees, Inf. Sci. 113 (1999), 293–300.
[21]
Sunitha M.S., Vijayakumar A., Some metric aspects of fuzzy graphs, in Proc. Conf. Graph Connect, 1999, pp. 111–114.
[22]
Sunitha M.S., Vijayakumar A., Complement of a fuzzy graph, Indian J. Pure Appl. Math 33(9) (2002), 1451–1464.
[23]
Sunitha M.S., Vijayakumar A., Blocks in fuzzy graphs, J. Fuzzy Math 13(1) (2005), 13–23.
[24]
Pandey S., Tokekar V., Prominence of MapReduce in BIG DATA Processing. In Fourth International Conference on Communication Systems and Network Technologies, IEEE, 2014, pp. 555–560.
[25]
Tom M., Sunitha S., Sum distance in fuzzy graphs, Annals of Pure and Applied Mathematics 7(2) (2014), 73–89.
[26]
Tong Z., Zheng D., An algorithm for finding the connectedness matrix of a fuzzy graph, Congr. Numer. 120 (1996), 189–192.
[27]
Yeh R.T., Bang S.Y., Fuzzy relations, fuzzy graphs and their applications to clustering analysis, Fuzzy Sets and Their Applications. Zadeh L.A., et al., Eds., New York, NY, USA Academic, 1975, pp. 125–149 .
[28]
Zadeh L.A., Fuzzy sets, Inf. Comput 8 (1965), 338–353.
Index Terms
- Identification of fuzzy blocks using sum distance metric
Index terms have been assigned to the content through auto-classification.
Recommendations
On blocks and stars in fuzzy graphs
In this paper, we introduce block of a fuzzy graph. It generalizes the concept of blocks of a graph. Depending on the nature of blocks, we identify a particular class of fuzzy graphs named K2 block graphs and characterize them using strongest strong ...
On the Strong Metric Dimension of Cartesian Sum Graphs
AbstractA vertex w of a connected graph G strongly resolves two vertices u, v ∈ V (G), if there exists some shortest u – w path containing v or some shortest v – w path containing u. A set S of vertices is a strong metric generator for G if every pair of ...
Extremal values on the eccentric distance sum of trees
Let G=(V"G,E"G) be a simple connected graph. The eccentric distance sum of G is defined as @x^d(G)=@?"v"@?"V"""G@e"G(v)D"G(v), where @e"G(v) is the eccentricity of the vertex v and D"G(v)=@?"u"@?"V"""Gd"G(u,v) is the sum of all distances from the vertex ...
Comments
Information & Contributors
Information
Published In
© 2019 – IOS Press and the authors. All rights reserved.
Publisher
IOS Press
Netherlands
Publication History
Published: 01 January 2019
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Nov 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in