CSE 2813 Discrete Structures. Adjacent Vertices in Undirected Graphs. Two vertices, u and v in an undirected graph G are called adjacent (or neighbors) in G, if {u,v} is an edge of G.An edge e connecting u and v is called incident with vertices u and v, or is said to connect u and v.The vertices

Related searches for Graph Terminology

Download Presentation
## PowerPoint Slideshow about 'Graph Terminology' - todd

**An Image/Link below is provided (as is) to download presentation**

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -