lecture 1: graph theory

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/22

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 11:48 PM on 8/26/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

23 Terms

1
New cards

graph

a way of specifying relationships among a collection

2
New cards

networks stress the importance of (A) over (B)

A. interactions between items
B. individual characteristics

3
New cards

relationships in a graph are represented by…

edges/links

4
New cards

collections of items in a graph are represented by…

nodes

5
New cards

an undirected relationship is…

symmetric

6
New cards

a directed relationship is…

asymmetric

7
New cards

what is the symmetric relationship between A and B in a social network?

A is B’s friend and B is A’s friend

8
New cards

what is the asymmetric relationship between A and B in a social network

A follows B, but B may not follow A

9
New cards

degree

number of connections/edges a node has to other nodes

10
New cards

in a network of n nodes and m edges, the minimum possible number of degrees is…

0

11
New cards

in a network of n nodes and m edges, the maximum possible number of degrees is…

n-1

12
New cards

a degree of 0 means that…

the network contains only one node/the node isn’t connected to anything else

13
New cards

a degree of n - 1 (where n is the number of nodes) means that…

the node is connected to every other node

14
New cards

in a network of n nodes and m edges, the sum of degrees is…

2m

15
New cards

every time an edge is added, the sum of degrees changes by…

increases by 2

16
New cards

the number of edges can be found by…

dividing the sum of degrees by 2

17
New cards

in order to exist, the sum of degrees must be…

even

18
New cards

path

a sequence of nodes with each consecutive pair connected by an edge

19
New cards

length of a path

number of steps it contains from beginning to end

20
New cards

distance

shortest path between two nodes

21
New cards

a graph is considered connected if…

each pair of nodes can be connected through a path

22
New cards

connected components

parts of a graph that are not connected to each other but have their own network of connected nodes

23
New cards

two nodes can be connected through a path if…

they are in the same components