In this paper we discussed the concept the characteristic and application of minimal spanning tree and how it is applied on network areas, and also we solved some real life problems. Vivek S | Dhivya Dharshini S | Megala R"A Study on Minimal Spanning Tree on Network Flow" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-5 , August 2018, URL: http://www.ijtsrd.com/papers/ijtsrd15794.pdf http://www.ijtsrd.com/mathemetics/applied-mathematics/15794/a-study-on-minimal-spanning-tree-on-network-flow/vivek-s

© All Rights Reserved

2 views

In this paper we discussed the concept the characteristic and application of minimal spanning tree and how it is applied on network areas, and also we solved some real life problems. Vivek S | Dhivya Dharshini S | Megala R"A Study on Minimal Spanning Tree on Network Flow" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-2 | Issue-5 , August 2018, URL: http://www.ijtsrd.com/papers/ijtsrd15794.pdf http://www.ijtsrd.com/mathemetics/applied-mathematics/15794/a-study-on-minimal-spanning-tree-on-network-flow/vivek-s

© All Rights Reserved

- CUDA Based Minimum Spanning Tree
- Unit 6 - Minimum Spanning Tree
- 알고리즘_4장-Greedy Approach
- Graph Teory
- source code for sudoku solver
- Lecture 0
- Dis Ing
- Algorithm Lecture15
- Dynamic Generators of Topologically Embedded Graphs
- lab1
- acsl 16-17 contest 4 notes - graph theory de assembly
- V2 Dijkstra Layout
- Module 3 Quick Reference
- K Anonymity Slide
- 13.pdf
- DSA Revision
- Benavides Et Al 2013 Iterated Algorithm Appl Electrical Network
- Practice Data Structures
- 8x8_01
- Lecture-22-CS210-2012.pptx

You are on page 1of 5

International Open Access Journal

ISSN No: 2456 - 6470 | www.ijtsrd.com | Volume - 2 | Issue – 5

A Study on

n Minimal Spanning Tree on

n Network Flow

Vivek S1, Dhivya Dharshini S2, Megala R2

1

Professor, 2B.Sc Mathematics

Assistant Professor

Sri Krishna Adithya College of Arts aand Science, Coimbatore, Tamil Nadu,

Nadu India

ABSTRACT

In this paper we discussed the concept the with is very important to optimize their designs by

characteristic and application of minimal spanning finding minimum

nimum spanning trees for them.

tree and how it is applied on network areas, and also Power Transmission Network: To provide high

we solved some real life problems. voltage power transmission lines.

Pipeline Network: To connect sources to a no of

KEYWORD: Network flow, Nodes, Links, Minimal destination.

spanning tree Transportation Network: To provide links at

minimum cost.

INTRODUCTION

Trees are nothing more than restricted types of graphs,

Algorithm:

just with many more rules to follow. A tree will always

Step 1: start with any given node. Connect it to the

be a graph, but not all graphs will be trees

trees. A vertex is

nearest distinct node. Tick all the nodes that have

also referred to as a node,

ode, a junction, a point 0 – cell

been connected.

or an 0 simplex. Instead of shortest spanning tree, one

Step 2: Identify the un connect node that is closest to

may wish to find a longest spanning tree or one may

a connected node and then connect these two nodes.

be interested the trees with other desired properties

Step 3: Repeat step2 untill all nodes area connected.

and constraints. Such as, a spanning tree with

The resulting network is guaranteed to be a minimal

specified maximum degree or diameter.

spanning tree they may be ties for the nearest distinct

node or the closest unconnected node. In such a cases

Characteristics:

break the ties arbitrarily the algorithm will still yield

We are given the nodes of a network but not the

an optimal solution.

link instead we are given the potential links

between node pairs and the length for each

potential link. General Problem:

The Midwest TV cable company is in the process of

It is desired to choose enough potential links in

providing cable services to five new housing

such a way that there is a part connecting all the

development areas. The figure below depict potential

nodes of the network.

tv linkages among the five areas. The cable miles are

That is no node is left out unconnected.

shown on each branch. Determine the most m

The choosen links must provide a path between

economical cable network for the Midwest Company.

each pair of node in such a way that the total

length of these links is a minimum.

Telecommunication networks: In these age of

information super highway application in this area

becomes, more important as many

telecommunication network are highly expensive

Aug 2018 Page: 1893

International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470

SOLUTION Step 4: The unconnected node closest to colored node

Step 1: We start with node 1.Connected to the nearest is node 6. So we connect node 6 to node 4.

distinct node 2.color node 1 and 2 as both are now

connected

is node 3. So we connect node 3 to node.

Step 2: identify the unconnected node that is closest

to a connected node. The unconnected node closest to

either nodes 1 or 2 is node 5. So, we connect node 2

to node 5 and color it to indicate that is connected

node.

minimal spnning tree provides an optimal solution.

spanning tree for the Midwest Company given by the

Step 3: the unconnected node closest any colored links connecting the node pairs as indicated.

node is node 4.So we connected to node 4 to node 2.

1-2-5; 2-4-6; 1-3.

tree is given by

Z = 1+3+4+3+5 = 16 miles.

PROBLEMS

Consider the following network where the number

on links represent actual distance between the

corresponding nodes. Find the minimal spanning

tree

@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug 2018 Page: 1894

International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470

Step 1: We start with node O. connect it to the nearest Step 5: The unconnected node closest to a coloured

distinct node A. Colour the nodes O and A as both are node is node D. So, we connect node D to node E.

now connected nodes.

Step 2: Identify the unconnected node that is closest node is node T. So, we connect node T to node D.

to a connected node. The unconnected node closest to

either node O or node A is node B. So, we connect

node A to node B and colour it to indicate that is

connected node.

spanning tree provide an optimal solution.

Step 3: The unconnected node closest to any coloured spanning tree for network is given by the link

node is node C. So, we connect node C to node B. connecting the node pairs as indicated :

O-A-B-C; B-E-D-T

is

Z = 4+1+2+4+1+6 = 18 miles

to determine which road telephone cable should be

install to connect all 7 work station with a minimal

total length of the cable .Node and distance of

potential links are given in the network below . Use

Step 4: The unconnected node closest to any coloured the minimal spanning tree algorithm to find the

node is node E. So, we connect node E to node B. most economical cable tree:

@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug 2018 Page: 1895

International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470

Step 1: We start with node O. connect it to the nearest Step 5: The unconnected node closest to a coloured

distinct node A .Colour the nodes O and A as both are node is node D. So, we connect node D to node E.

now connected nodes.

Step 2: Identify the unconnected node that is closest node is node T. So, we connect node T to node D.

to a connected node. The unconnected node closest to

either node O or node A is node B. So, we connect

node A to node B and colour it to indicate that is

connected node.

spanning tree provide an optimal solution.

Step 3: The unconnected node closest to any coloured The most economical cable network, i.e. the

node is node C. So, we connect node C to node B. minimal spanning tree for network is given by the link

connecting the node pairs as indicated:

O-A-B-C; B-E-D-T

is

Z = 2+2+1+3+1+5 = 14 miles

Conclusions:

These problems can be expressed and solved

elegantly as graph theory problems involving

Step 4: The unconnected node closest to any coloured connected and weighted digraph. From a practical

node is node E. So, we connect node E to node B. point of view, all these problems are trivial if the

network is small. Many real life situation however

@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug 2018 Page: 1896

International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470

consist of huge networks, and therefore it is important 3. PRIM, R. C.,”shortest connection networks and

to look at these network problems in terms of solving some generalization“: Bell system tech.

them on computers. 4. P. R.VITTAL, Introduction of Operation Research

Reference: 5. BATTERSBY, A. network analysis for planning

1. KANTI SWARUP, P.K.GUPTA MAN MOHAN, and scheduling, New York.

Operations Research 6. FULKER SON, D. R. Flow networks and

2. NARSINGH DEO, Graph Theory with combinational operation research.

applications to engineering and computer science.

@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 5 | Jul-Aug 2018 Page: 1897

- CUDA Based Minimum Spanning TreeUploaded byChengyaoTan
- Unit 6 - Minimum Spanning TreeUploaded byVaibhav Makkar
- 알고리즘_4장-Greedy ApproachUploaded byJungWoo Cho
- Graph TeoryUploaded byVijaykumar Chiniwar
- source code for sudoku solverUploaded byapi-292892066
- Lecture 0Uploaded byMohamed Ali
- Dis IngUploaded bysaifmohammedmakki
- Algorithm Lecture15Uploaded byHasan Mohammad
- Dynamic Generators of Topologically Embedded GraphsUploaded byMirza Ahad Baig
- lab1Uploaded byjamesstudios8
- acsl 16-17 contest 4 notes - graph theory de assemblyUploaded byapi-328824013
- V2 Dijkstra LayoutUploaded bycalpostigo
- Module 3 Quick ReferenceUploaded byNaresh Raju
- K Anonymity SlideUploaded byThái Duy Cường
- 13.pdfUploaded bysemselvan794694
- DSA RevisionUploaded bysiddhipandey
- Benavides Et Al 2013 Iterated Algorithm Appl Electrical NetworkUploaded byhonquell123
- Practice Data StructuresUploaded byWale Whales Oyediran
- 8x8_01Uploaded byapi-3843571
- Lecture-22-CS210-2012.pptxUploaded byMoazzam Hussain
- Project Planning (1)Uploaded byrohin garg
- Computation PhysicsUploaded byQaisar Shah
- Algorithm Design - Jon Kleinberg, Eva Tardos-split-merge (2)Uploaded byAyush Awasthi
- Test 2Uploaded byTsahi Flysher
- Full Substractur Using Structural ModellingUploaded byAniruddha Kanhe
- 17_tm2Uploaded byHuong Luong
- LlanesII-P2-ForwardChainingUploaded byTed Llanes
- ArraysUploaded byTholakele Thola
- DocumentUploaded bykarthik
- last 4 pgms with op.Uploaded byPavithraRam

- Web Based Event Management System EMSUploaded byEditor IJTSRD
- Nutraceuticals, trace metals and radioactivity in edible seaweeds for food safety: An overviewUploaded byEditor IJTSRD
- Existence of Extremal Solutions of Second Order Initial Value ProblemsUploaded byEditor IJTSRD
- Design Selection of CT and PT' Effective for Transmission LinesUploaded byEditor IJTSRD
- Object and Reasons of Domestic Violence ActUploaded byEditor IJTSRD
- Age Invariant Face RecognitionUploaded byEditor IJTSRD
- Digital Citizenship in Education Visioning Safety and Responsibilities in Digital WorldUploaded byEditor IJTSRD
- Applied SPSS for Business and MarketingUploaded byEditor IJTSRD
- Analysis on Optimization Selection of Nursing Service Delivery Mode in Long Term Nursing Insurance SystemUploaded byEditor IJTSRD
- Telecom Industry with Customer Loyalty of MongoliaUploaded byEditor IJTSRD
- Design, Optimization and Analysis of a Radial Active Magnetic Bearing for Vibration ControlUploaded byEditor IJTSRD
- A Review Paper on Experimental Study on Stabilization of Soil Subgrade by Adding Stone DustUploaded byEditor IJTSRD
- Interpreting Video Assistant Referee and Goal Line Technology Communication The Pitch Based Referees PerspectivesUploaded byEditor IJTSRD
- Application of Taguchi Method for Optimization of Process Parameters in Drilling OperationUploaded byEditor IJTSRD
- Control and Operation of a DC Grid Based Wind Power Generation System in Micro GridUploaded byEditor IJTSRD
- Internet of Things IoT Security PerspectiveUploaded byEditor IJTSRD
- Development of Gastroretentive Floating Tablets Quetiapine FumarateUploaded byEditor IJTSRD
- A Novel Approach on Thalidomide and their Analogues with their Therapeutic uses and Clinical ApplicationUploaded byEditor IJTSRD
- A Study on Ad Hoc on Demand Distance Vector AODV ProtocolUploaded byEditor IJTSRD
- Solar and Electric Powered Hybrid VehicleUploaded byEditor IJTSRD
- The Review of Energy Efficient NetworkUploaded byEditor IJTSRD
- Compatibility Design of Non Salient Pole Synchronous GeneratorUploaded byEditor IJTSRD
- Competitive Landscape of Insulin Market in IndiaUploaded byEditor IJTSRD
- Building a Quality Management System in Higher EducationUploaded byEditor IJTSRD
- A Survey Paper on Identity Theft in the InternetUploaded byEditor IJTSRD
- CFD Simulation of Air Conditioning System of the ClassroomUploaded byEditor IJTSRD
- Driving Factors and Developing of the Implementation of E Business in SMEsUploaded byEditor IJTSRD
- Cashless Policy and Financial Performance of Deposit Money Banks in NigeriaUploaded byEditor IJTSRD
- Task Environment and Organisational Responsiveness in Nigerian BanksUploaded byEditor IJTSRD
- Land and Flying RobotUploaded byEditor IJTSRD

- C4C Data Workbench 1511Uploaded byChirdeep Rastogi
- Passerelle FIPIO _ Modbus RTU LUFP1Uploaded bymanuela88
- Experiment 4Uploaded byhamza shahbaz
- SA-WN551G User GuideUploaded byEnrique Gess
- Diameter AgentsUploaded byK Peng Tan
- BreezeMAX 3500 Ver AUploaded byNils Branting
- Iweb Administration PackagesUploaded byjnieto29
- SMART POWERAPP BUG for Unlimited Internet Connection This 2016! _ 2016 and 2015 Working Internet Hack for Globe, Smart and Sun BroadbandUploaded byGui Fawkes
- basic of SCADA.pdfUploaded byHameed
- SAP HANA Direct Extractor Connection Implementation Guide EnUploaded bynotmelbrooks
- STMSProjectIntegrationGuideUploaded byakeakeake
- HP ArcSight Ports and ProtocolsUploaded bysuperman1293
- Open SshUploaded byconver68
- NETAPP CABLING AND HARDWARE BASICSUploaded byAnup Abhishek
- Step-By-Step Guide for File Server Resource Manager in Windows Server 2008Uploaded byWILLIAM BODIE
- RFP-Data Centre Colocation ServicesUploaded byCan dien tu Thai Binh Duong
- OAW4504XM-4604-4704_031970-C_11Sept-FinalUploaded bygaulirb
- ciscofiinal switchUploaded byh455
- FAQ Using SAP Cloud Appliance LibraryUploaded byRakindra Nath
- Excerpt GB8Uploaded byHesham_Hegazy18
- Gei-100513 Hmi Time SynchUploaded byAnonymous GH1ydID
- Tutorial Creating an OData Service Based on SAP GatewayUploaded byRichard
- Operations Guide FinalUploaded byjaleelpeace9157
- UCS Test Drive Course Description v5.5Uploaded byAnthony Lobosco
- Assignment Presentation on Social Network AnalysisUploaded bysocain
- AVR RISC MICROCONTROLLERUploaded byAmy Oliver
- oraclee-businesssuiter12-170204035537.pdfUploaded byFary Ndong
- Random Tales Mobile HackerUploaded byJonel Kay Howard
- Best Practice When Sanitize POSTUploaded byAB Malek Idris
- CE_2-0_Ethernet_Access_Services_Paper_2013021_2013-10-21 (1)Uploaded bySergio M. Blanco