Connected Components Among the Integers
Let \(g \) be the graph whose vertices are the integers, where an edge exists between every pair of vertices \(i \) and \(j \) iff \(|i-j|=6 \).
-
How many connected components does \(g \) have?
Home » Courses » Electrical Engineering and Computer Science » Mathematics for Computer Science » Unit 2: Structures » 2.9 Coloring & Connectivity » 2.9.8 Connected Components in Integers
Let \(g \) be the graph whose vertices are the integers, where an edge exists between every pair of vertices \(i \) and \(j \) iff \(|i-j|=6 \).
How many connected components does \(g \) have?