Graph: difference between cycle & circuit

Click For Summary
SUMMARY

The discussion clarifies the distinction between cycles and circuits in graph theory. A cycle is defined as a closed path where neither vertices nor edges repeat, except for the starting and ending vertex. In contrast, a circuit allows for repeated vertices but not repeated edges. The example provided illustrates that the path ABCEFDA is a cycle and, consequently, also a circuit, while a figure-eight path like DBCDAFD serves as an example of a circuit that is not a cycle.

PREREQUISITES
  • Understanding of basic graph theory concepts
  • Familiarity with the definitions of cycles and circuits
  • Knowledge of vertex and edge terminology
  • Ability to analyze graph representations
NEXT STEPS
  • Study the properties of directed and undirected graphs
  • Learn about Eulerian and Hamiltonian paths in graph theory
  • Explore algorithms for detecting cycles in graphs
  • Investigate applications of cycles and circuits in network design
USEFUL FOR

Students and educators in mathematics or computer science, particularly those focused on graph theory, as well as software developers working with algorithms related to graph structures.

zak100
Messages
462
Reaction score
11

Homework Statement


What is the difference between a cycle & a circuit? (Definition not reqd, guidance reqd with the figure attached)

Homework Equations



No

The Attempt at a Solution


See the attached figure. According to this figure the walk AB, BC, CE, EF, FD, DA represents a cycle or not because we have a repeated vertex B?? (in my view its not a cycle because we have a repeated vertex in the middle).However it represents a circuit because there is no repeated edge.
Some body please guide me whether i am correct or not & give an example of cycle from the figure. Sorry for the picture not fitting with size. I have created it on paint & then saved it but i don't know how to get rid of extra white space.

Zulfi.
cycle & circuit diff2.png
 
Physics news on Phys.org
Both cycles and circuits are closed paths, meaning they end at the same vertex as where they started.
For a circuit, vertices may be repeat but not edges.
For a cycle, neither edges nor vertices may repeat (except that the start vertex is the same as the finish vertex).
Hence all cycles are circuits, but not vice versa.

The path listed above is a cycle (and hence also a circuit).
Why do you think it has a repeated vertex? As I read your post it goes ABCEFDA, so there are no repeated vertices (there are six vertices and six edges).

An example of a circuit that is not a cycle would be a figure eight, such as DBCDAFD
 
Hi,
Thanks. Good Answer.
<Why do you think it has a repeated vertex? >

Actually i was using the whole edge. Now i know that i have to use only the vertices. i.e instead of AB, BC, CE, EF, FD, DA, i have to write only:
ABCEFDA.

Zulfi.
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
5K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
7K
  • · Replies 22 ·
Replies
22
Views
16K
  • · Replies 2 ·
Replies
2
Views
5K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K