Prove that a simple graph is connected, Mathematics

Assignment Help:

Prove that a simple graph is connected if and only if it has a spanning tree.   

Ans: First assume that a simple graph G has a spanning  tree T.  T consists of every node of G.  By the definition of a tree, there is a path among any two nodes of T.  As T is a subgraph of G, there is a path among each pair of nodes in G. Hence G is connected.   

Here now let G is connected. If G is a tree then nothing to prove. If G is not a tree, it must consist of a simple circuit. Let G has n nodes. We can choose (n - 1) arcs from G in such type of a way that they not form a circuit. It results into a subgraph comprising all nodes and only (n - 1) arcs. So by definition this subgraph is a spanning tree.


Related Discussions:- Prove that a simple graph is connected

Define points, Define Points, Lines, and Spaces Points, lines, and planes...

Define Points, Lines, and Spaces Points, lines, and planes are known as undefined or primitive terms. These are the most significant and fundamental concepts in the study of geom

Example to understand means to count, Place ten pebbles (or any other such ...

Place ten pebbles (or any other such objects) in front of a child who can recite number names upto ten in the correct sequence. Ask him/her to count them aloud while touching the p

Case let, How should Shoppers’ Stop develop its demand forecasts?

How should Shoppers’ Stop develop its demand forecasts?

Binding constraints for the original linear program model, A toy company pr...

A toy company produces 2 models of water guns: spray king and zapper. They are manufactured in batches for easier packaging and sale. Two of the limiting resources are 1200 pounds

Objectives of why learn mathematics, Objectives After studying this uni...

Objectives After studying this unit, you should be able to explain how mathematics is useful in our daily lives; explain the way mathematical concepts grow; iden

Find a longest common substring - suffix trees, 1. Using suffix trees, give...

1. Using suffix trees, give an algorithm to find a longest common substring shared among three input strings: s 1 of length n 1 , s 2 of length n 2 and s 3 of length n 3 .

Introduction to learning to count, INTRODUCTION : Most of us, when plannin...

INTRODUCTION : Most of us, when planning the first mathematical experience for three-year olds, think in terms of helping them memorise numbers from 1 to 20. We also teach them to

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd