Constructing Spanning Tree in Banking Sector Problem Using Different Types of Algorithms

M. Vijaya¹ , B. Mohanapriyaa²

Section:Research Paper, Product Type: Isroset-Journal
Vol.5 , Issue.4 , pp.359-370, Aug-2018

CrossRef-DOI:   https://doi.org/10.26438/ijsrmss/v5i4.359370

Online published on Aug 31, 2018

Copyright © M. Vijaya , B. Mohanapriyaa . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

312 Views    141 Downloads    81 Downloads

Abstract :
Fuzzy graphs are used as device for modeling and description of the real world. Network systems such are Banking, Transport, water, electricity, internet, work operations schemes in the process of production, construction etc…. Banking system keeps the day by day tally record as a complete banking. It can keep the information of account type, account opening form, deposit, with drawl and searching the transaction. The working of banking account system and cover the basic functionality of a bank account management system. The main focus is to a systematic study of algorithms. Basic banking itself needs to be supported by innovative strategies, in order to improve the reach and reduce the operating cost of the banks. Infrastructure sharing amongst banks and organizations will help in lowering the in commission cost and thus the cost benefit can be transferred to customers. Greater use of technology should be made by the banks to improve their reach, speed of processing, as well as to cut down the operating cost. An illustrative example is included to demonstrate the proposed algorithm. This paper is designed to find a key application of the fund available for investment for the customer to the bank using Nearest Neighbor Algorithm, Repeated Nearest Neighbor Algorithm, Cheapest Link Algorithm and Kruskal`s Algorithm to a randomly weighted fuzzy graph. These algorithm continuously increases the size of a fuzzy tree, one edge at a time, starting with a fuzzy tree consisting of a single vertex, until it spans all vertices of the fuzzy graph.

Key-Words / Index Term :
Fuzzy Spanning Tree-Nearest Neighbor Algorithm-Repeated Nearest Neighbor Algorithm-Cheapest Link Algorithm-Kruskal’s Algorithm

References :
[1]. A.NAGOORGANI and V.T.CHANDRASEKARAN: A First Look at Fuzzy Graph Theory Allied Publishers Pvt. Ltd.
[2]. A.NAGOORGANI and V.T.CHANDRASEKARAN: An Algorithm on domination Number of a graph, International Journal of Mathematics and Computer Science, Lebanon, 2(2007), no.3,231-235.
[3]. DR.G,NIRMALA and K.UMA: Fizzy Shortest Route Algorithm For Telephone Line Connection, International Journal of Scientific and Research Publication, Volume 2, Issue 8, August2012.
[4]. H.J.ZIMMERMANN: Fuzzy set theory and its Application. Allied Publishers Limited, 1996.
[5]. L.A.ZADEH: Fuzzy logic and the calculi of fuzzy rules and fuzzy graphs, a précis, Multi. Val. Logic, 1:1-38, 1996.
[6]. CHRISTOFIDES, N: Graph Theory: an algorithm approach. Academic Press, London, 1975.
[7]. HALPERN.J, MAIMAON.O: Algorithm for the m-center problems; a survey. European J. Operational Res. 10, 1982, 90-99.
[8]. T.N. Chuang, J.Y.Kung, The fuzzy shortest path length and the corresponding shortest path in a network, Computers & Operations Research 32 (2005) 1409-1428.
[9]. C.lin, M.S. Chern, The fuzzy shortest path problem and its most vital arcs, Fuzzy Sets and Systems 58 (1993) 343-353.