Download presentation

Presentation is loading. Please wait.

Published byJeremiah Mealor Modified over 3 years ago

3
It's consisting of vertices and edges that connect these vertices. Its have different types that differ with respect to the kind and number of edges that can connect pair of vertices..

4
Set V = v(G) whose element are called vertices, points or nodes of G.. Set E =E(G) of unordered pairs of distinct vertices called edges of G استغفر الله وأتوب إليه

5
1..Simple of graph: G(V,E)consist of V, a nonempty set of vertices and E, a set of unordered pairs of distinct elements of V called edges.. ab c d e1 e2 e3 e4 e5

6
a c BdBd b e1 e2 e3 e4 e5

7
AcAc b d a c e1 e2 e3 e4 e8 e7 e5e6 e9

8
Fine the components of the short and represent to matrix…and what it type of it ? A b C d

9
G=(V,E) V=[a,b,c,d] E=[(a,b),(b,c),(b,d),(a,c),(c,d),(a,d)] |V|=4 vertices.. |E|=6 edges.. Deg(a)=3 Deg(b)=3 Deg(c)=3 Deg(d)=3

10
a,b,c,a length =3 d,b,c,d length =3 a,b,c,d,a length =4 Matrix: a b c d a 0 1 1 1 b 1 0 1 1 c 1 1 0 1 d 1 1 1 0 Type of graph :{simple graph}..

11
1 2 c F b a a c b d c a f b d

12
دانه محمد مها راشد سحر سعيد هيا عبد الله هيا سالم

Similar presentations

OK

Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,

Lecture 5 Graph Theory. Graphs Graphs are the most useful model with computer science such as logical design, formal languages, communication network,

© 2018 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Games we play ppt on dvd Ppt on indian politics Download a ppt on natural disasters Ppt on 10 sikh gurus sikhism Ppt on fire extinguisher types pictures Ppt on abstract art paintings Ppt on density based traffic light control system Ppt on general election 2014 Ppt on polynomials of 91 View my ppt online viewer