2 views

Uploaded by Editor IJTSRD

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

- 23 DynDet (AIRO2004)
- chapter-5
- 11 Capacity
- Enumerating Labeled Trees
- Cayley Tree
- Function to Generate PN Sequence
- Chapter 7
- A Comparative study on clustering of data using Improved K-means Algorithms
- 期末考_雷射治療擴充題
- bo_siggraphasia2011_fluid.pdf
- Routing Algorithms and Algorithms for Lifetime-Optimization in Complex Sensor-Actuator-Networks
- soln
- Connor Ch9
- Peldszus 2015. Kratki Tekstovi
- Merge Sort
- Latex Presentation Sample
- r05220502-design-and-analysis-of-algorithms
- Data Mining
- Critical Path Method
- 1.Token

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

- 23 DynDet (AIRO2004)Uploaded byguido gentile
- chapter-5Uploaded byKarim
- 11 CapacityUploaded byammezz
- Enumerating Labeled TreesUploaded byjulianmscl
- Cayley TreeUploaded byDya Yadiailaika
- Function to Generate PN SequenceUploaded byFetsum Lakew
- Chapter 7Uploaded byHari Krishna
- A Comparative study on clustering of data using Improved K-means AlgorithmsUploaded byseventhsensegroup
- 期末考_雷射治療擴充題Uploaded byapi-26360835
- bo_siggraphasia2011_fluid.pdfUploaded byVicshann
- Routing Algorithms and Algorithms for Lifetime-Optimization in Complex Sensor-Actuator-NetworksUploaded byVenkatesh Garala
- solnUploaded bynarendranvel
- Connor Ch9Uploaded byJose Haro
- Peldszus 2015. Kratki TekstoviUploaded byIvan Trifunjagić
- Merge SortUploaded byarchumeenabalu
- Latex Presentation SampleUploaded byMarco André Argenta
- r05220502-design-and-analysis-of-algorithmsUploaded bySRINIVASA RAO GANTA
- Data MiningUploaded bykdeepanraj
- Critical Path MethodUploaded byuname
- 1.TokenUploaded byNithiyanantham Bcomca
- Prolog Home AssignmentsUploaded bymikebites
- Chap 2Uploaded bySparśa Roychowdhury
- codeUploaded byapi-320874752
- Merge Sort AlgorithmUploaded byEllizabeth Lilanti
- TREE.DOCUploaded byJatin Chaudhari
- Lab4Uploaded byYuri Kim
- Dalgo algorithmUploaded byMohit Dayal
- SortUploaded bysankar_mca227390
- graphs1 (1)Uploaded byladi9510

- A Review of Super Resolution and Tumor Detection Techniques in Medical ImagingUploaded byEditor IJTSRD
- Sentiment AnalysisUploaded byEditor IJTSRD
- Digital Tachometer using AurdinoUploaded byEditor IJTSRD
- Bit Error Rate Performance Evaluation of Different Digital Modulation and Coding Techniques with Varying ChannelsUploaded byEditor IJTSRD
- Design and Fabrication of Thermo Electric RefrigeratorUploaded byEditor IJTSRD
- Design ThinkingUploaded byEditor IJTSRD
- Moving Grocery Store using A.I Powered RobotsUploaded byEditor IJTSRD
- Legislative provision with Respect to Child LabourUploaded byEditor IJTSRD
- Preparation of Fan Coil Unit using Revit SoftwareUploaded byEditor IJTSRD
- Automatic Temperature Controlled Air Cooler Design, Assembly and TestingUploaded byEditor IJTSRD
- Facial Emoji RecognitionUploaded byEditor IJTSRD
- Effect of Capacity Building on Productivity Alcoholic Beverage CompaniesUploaded byEditor IJTSRD
- Ecosystem Services and Perception of Water Quality of Lake Barombi Kotto, CameroonUploaded byEditor IJTSRD
- Antimicrobial Efficacy of Medicinal Mushroom Ganoderma LucidumUploaded byEditor IJTSRD
- Analysis of Air Conditioning System used in AutomobileUploaded byEditor IJTSRD
- Structures to Resist the Effects of the Accidental ExplosionsUploaded byEditor IJTSRD
- Object Detection An OverviewUploaded byEditor IJTSRD
- Generation of Air Conditioning by using Exhaust Gases and Cooling Water of an Automobile EngineUploaded byEditor IJTSRD
- 331 RP-75 Formulation of Two Special Classes of Standard Congruence of Prime Modulus of Higher Degree.pdfUploaded byEditor IJTSRD
- Design of an Air Distribution System for a Multi Storey Office BuildingUploaded byEditor IJTSRD
- Profile Identification through Face RecognitionUploaded byEditor IJTSRD
- Bleeding Brain IntraparenchymalUploaded byEditor IJTSRD
- Comparative CFD and Simulative Analysis of Flow Behaviour to Calculate Losses in Different Geometrical PipesUploaded byEditor IJTSRD
- Drunk and Drive Detection using Raspberry PiUploaded byEditor IJTSRD
- A Study on Food Habits and Social Habits as Risk Factors among Patients Undergoing Percatenous Transluminal Coronary Angioplasty PTCAUploaded byEditor IJTSRD
- Automatic Car Washing and Drying using Microcontroller 8051Uploaded byEditor IJTSRD
- IOT Based Smart CitiesUploaded byEditor IJTSRD
- Additive Manufacturing of Leaf SpringUploaded byEditor IJTSRD
- Implementation of a Robotic Vehicle using an RF ModuleUploaded byEditor IJTSRD
- Smart Solar Grass Cutter RobotUploaded byEditor IJTSRD

- Final ExamUploaded bya23mer1439
- WPS2 Dongle M EnUploaded bygesandoval2008
- DxDiagUploaded byUlin Nuha
- Association RuleUploaded bysskalees
- XML Workflow DiscovererUploaded bySathish Kumar
- Chapter 8Uploaded bytbijle
- Hardware Compatibility List (HCL) for Veritas Storage Foundation (Tm) and High Availability Solutions 4.1 MP2 for SolarisUploaded bybennial
- KL PartitioningUploaded byjakk234
- SAP BI (DSO)Uploaded byJaguar
- Curriculum BrochureUploaded byBhanu Bhandari
- qprogUploaded byAdriana Ascanio
- Mobile VuGen Scripting __ WilsonMarUploaded byaustinfru7
- Wireless m Bus Quick Start GuideUploaded byprasanthvv
- Userguige New ServerUploaded byEsapa Eyongesi
- argoUMLUploaded bykaik7
- Datasheet 8051Uploaded bykchaitanya_14
- Performance Tuning of Datastage Parallel JobsUploaded byನಾಗಾಭರಣ ವಿ ಜಿ
- gyropaperUploaded bypepunato
- SoleymaniUploaded byAnonymous wWOWz9UnW
- Tkinter 8.4 reference - a GUI for Python (2010).pdfUploaded byabden66
- F18 User Manual V1.1-20120425Uploaded byOsvaldo Anaya
- 8086 internal architectureUploaded byAman Khera
- Video Inpainting SynopsisUploaded bySumit Gharat
- A WIRELESS FINGERPRINT ATTENDANCE SYSTEMUploaded byijsptm
- Read MeenUploaded bykusanagi182
- Troubleshooting RPC Endpoint Mapper Errors Using the Windows Server 2003 Support Tools From the Product CDUploaded byAnderson Silva
- Oracle Aplication Server-InstalacionUploaded byRafael Mendez
- Shortest path finding: A comparison between A*, Breadth First Search, and Uniform Cost SearchUploaded byNguyen Phuc Nguyen
- David Mount - Algorithm Notes GoodUploaded byapi-26825468
- md5Uploaded byyqqwe