Hey there! We receieved your request
Stay Tuned as we are going to contact you within 1 Hour
One of our academic counsellors will contact you within 1 working day.
Click to Chat
1800-5470-145
+91 7353221155
Use Coupon: CART20 and get 20% off on all online Study Material
Complete Your Registration (Step 2 of 2 )
Sit and relax as our customer representative will contact you within 1 business day
OTP to be sent to Change
hello
formula for finding no of trees in a network graph??
Dear student,
A network is a collection of points, called vertices, and a collection of lines, called arcs, connecting these points. A network is traversable if you can trace each arc exactly once by beginning at some point and not lifting your pencil from the paper. The problem of crossing each bridge exactly once reduces to one of traversing the network representing these bridges.
Euler made the remarkable discovery that whether a network is traversable depends on the number of odd vertices. In the Königsberg network, there are an odd number of arcs at point A, so A is called an odd vertex. If the number of arcs meeting at a point is even, the point is called an even vertex. Euler found that the only traversable networks are those that have either no odd vertices or exactly two odd vertices. Since the Königsberg network has four odd vertices, it is not traversable. Therefore, it is not possible to take a walk over the bridges of Königsberg and cross each bridge only once.
Please feel free to ask your queries here. We are all IITians and here to help you in your IIT JEE preparation. All the best. Win exciting gifts by answering the questions on Discussion Forum. So help discuss any query on askiitians forum and become an Elite Expert League askiitian. Now you score 5+15 POINTS by uploading your Pic and Downloading the Askiitians Toolbar respectively : Click here to download the toolbar.. Askiitians Expert Sagar Singh B.Tech, IIT Delhi
Please feel free to ask your queries here. We are all IITians and here to help you in your IIT JEE preparation.
All the best.
Win exciting gifts by answering the questions on Discussion Forum. So help discuss any query on askiitians forum and become an Elite Expert League askiitian.
Now you score 5+15 POINTS by uploading your Pic and Downloading the Askiitians Toolbar respectively : Click here to download the toolbar..
Askiitians Expert
Sagar Singh
B.Tech, IIT Delhi
Get your questions answered by the expert for free
You will get reply from our expert in sometime.
We will notify you when Our expert answers your question. To View your Question
Win Gift vouchers upto Rs 500/-
Register Yourself for a FREE Demo Class by Top IITians & Medical Experts Today !