MIS 301 Exam 3
Networks - correct answer ✔Collections of points joined by lines
, "graphs"
Network points are called - correct answer ✔Nodes
Network lines are called - correct answer ✔Edges, arcs
Directed network (alos called arc) - correct answer ✔A -> B
A and b like each other, a gave a gift to b, a is b's child
Undirected newtwork - correct answer ✔A <-> B or A - B
A and b like each other, a and b are siblings, a and b are co authors
Edge attributes: weight - correct answer ✔frequency of communication
Edge attributes: ranking - correct answer ✔ex: best friend, second best
friend
Edge attributes: type - correct answer ✔friend, relative, co-worker
Geodesic path - correct answer ✔shortest pat, shortest sequence of links
connecting two nodes, not always unique
Eccentricity - correct answer ✔a nodes largest geodesic distance in the
network, a measure of how far a node if from the furthest other
, Diameter - correct answer ✔the largest geodesic distance in the network, it
gives the number of steps that are sufficient to go from any node to any other
node
Average path length - correct answer ✔the average number of sets along the
shortest path for all possible pairs of network nodes
Node network properties (immediate connections): indegree - correct answer
✔how many directed edges are incident on a node (come into a node)
Node network properties (immediate connections): outdegree - correct
answer ✔how many directed edges originate at a node (come out from the
node)
Node network properties (immediate connections): degree (in or out) - correct
answer ✔number of edges incident on a node (number of connections a node
has)
Node network properties (immediate connections): degree centrality - correct
answer ✔nodes having many edges are central
Node network properties (from the entire graph):
centrality degree - correct answer ✔the number of direct connections a node
has
Node network properties (from the entire graph): centrality betweeness -
correct answer ✔the fraction of all directed paths between any two vestiges
that pass through a node, a node with the highest betweenness has great
influence over what flows, and does not flow, in the network
Networks - correct answer ✔Collections of points joined by lines
, "graphs"
Network points are called - correct answer ✔Nodes
Network lines are called - correct answer ✔Edges, arcs
Directed network (alos called arc) - correct answer ✔A -> B
A and b like each other, a gave a gift to b, a is b's child
Undirected newtwork - correct answer ✔A <-> B or A - B
A and b like each other, a and b are siblings, a and b are co authors
Edge attributes: weight - correct answer ✔frequency of communication
Edge attributes: ranking - correct answer ✔ex: best friend, second best
friend
Edge attributes: type - correct answer ✔friend, relative, co-worker
Geodesic path - correct answer ✔shortest pat, shortest sequence of links
connecting two nodes, not always unique
Eccentricity - correct answer ✔a nodes largest geodesic distance in the
network, a measure of how far a node if from the furthest other
, Diameter - correct answer ✔the largest geodesic distance in the network, it
gives the number of steps that are sufficient to go from any node to any other
node
Average path length - correct answer ✔the average number of sets along the
shortest path for all possible pairs of network nodes
Node network properties (immediate connections): indegree - correct answer
✔how many directed edges are incident on a node (come into a node)
Node network properties (immediate connections): outdegree - correct
answer ✔how many directed edges originate at a node (come out from the
node)
Node network properties (immediate connections): degree (in or out) - correct
answer ✔number of edges incident on a node (number of connections a node
has)
Node network properties (immediate connections): degree centrality - correct
answer ✔nodes having many edges are central
Node network properties (from the entire graph):
centrality degree - correct answer ✔the number of direct connections a node
has
Node network properties (from the entire graph): centrality betweeness -
correct answer ✔the fraction of all directed paths between any two vestiges
that pass through a node, a node with the highest betweenness has great
influence over what flows, and does not flow, in the network
