Special Graphs

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/4

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 2:52 AM on 6/25/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

5 Terms

1
New cards

Complete Graph Kn

Contains exactly one edge between each pair of distinct vertices

<p><span style="background-color: transparent;">Contains exactly one edge between each pair of distinct vertices</span></p>
2
New cards

Cycle Graph Cn

Consists of a single cycle, where each vertex is connected in a closed loop to form a circular structure.

<p><span style="background-color: transparent;">Consists of a single cycle, where each vertex is connected in a closed loop to form a circular structure.</span></p>
3
New cards

Wheel graph Wn

Consists of a cycle with an additional central vertex connected to all vertices of the cycle, forming a wheel-like structure.

<p>Consists of a cycle with an additional central vertex connected to all vertices of the cycle, forming a wheel-like structure.</p>
4
New cards

n-cube Qn

Has vertices representing the 2n bit strings of length n. Two vertices are adjacent if and only if the bit strings that they represent differ in exactly one bit position.

<p><span style="background-color: transparent;">Has vertices representing the 2n bit strings of length n. Two vertices are adjacent if and only if the bit strings that they represent differ in exactly one bit position.</span></p>
5
New cards

Complete bipartite graph Km,n

A graph with m vertices in one group and n vertices in the other group. 

  • Every vertex in one group is connected to every vertex in the other group.

<p><span style="background-color: transparent;">A graph with m vertices in one group and n vertices in the other group.&nbsp;</span></p><ul><li><p><span style="background-color: transparent;">Every vertex in one group is connected to every vertex in the other group.</span></p></li></ul><p></p>