Chapter 5: Euler Paths and Circuits

अब Quizwiz के साथ अपने होमवर्क और परीक्षाओं को एस करें!

Connected graph

A graph such that there is a path going from any vertex to any other vertex

Disconnected graph

A graph that is not connected, it has two or more connected components

Simple graph

A graph with no loops or multiple edges

Euler path

A path that travels along each edge of a graph once and only once

Path

A sequence of edges each adjacent to the next, with no edge included more than once, and starting and ending at different vertices

Clique

A set of vertices with the property that any two are adjacent

Isolated vertex

A vertex of one degree

Bridges

An edge in a connected graph without which the graph would be disconnected

Loop

An edge that connects a vertex with itself

Circuit

Same as a path but starting and ending at the same vertex

Euler circuit

A circuit that travels along each edge of a graph once and only once

Length

Number of edges in a path or a circuit

Degree

Number of edges meeting at the vertex

Adjacent edges

Two edges with a shared vertex

Multiple edges

Two or more edges connecting the same two vertices

Adjacent vertices

Two vertices connected by an edge

Components

the connected "pieces" that make up a graph


संबंधित स्टडी सेट्स

Financial Accounting Module 7 Practice

View Set

Personal Finance Chapter 7 HW Part I

View Set

Chapter 11 Customer Accounts Questions

View Set

TestOut Server 2016 Chapter 7 (7.1.4, 7.2.8, 7.3.5, 7.4.6, 7.5.9, 7.6.5, 7.7.6, 7.8.8, 7.9.5, 7.10.4)

View Set

BUS 391: INFORMATION SYSTEMS FINAL

View Set

中文 第三级 第五课 我是谁(语句)

View Set

Chapter 1, Anthropology Exam 1, Chapter 2, Anth 101: Quiz 1 (Midterm Prep), Anthropology Quizes, Anthro exam

View Set

Intro to Hospitality and Tourism: Modules 5 -10

View Set

Personal Selling MKT 310 Final Exam ch. 12, 13, 14

View Set