Network Properties 1 Flashcards
A graph that has on self-edges or mutli-edge is called a ……
simple network or graph.
A graph with multi-edges is called a…
multi- graph
What are the two different ways to represent a network on computer?
Edge List and Adjacency matrix
What is an identity matrix?
it is a diagonal matrix where all the diagonal entries are equal to 1.
When is a directed graph cyclic?
A graph that contains closed loops.
Bi-Partide graphs are also called. and what are they ?
affiliation or two-mode graph. a group of nodes are connected together by some sort of kind
what the formula for dennsity
actual connections / potential connections
whats the formula for potenial formula
n(n-1)/2
Paths that do not intersect themselves are
Self-Avoiding paths
give an example of a avoiding path
Geodesic path
What is a geodesic path ?
it is the shortest path between two vertices such that no shorts path exist.
Whats the diameter of a graph
It is the longest geodesic path between any pair of vertices in a network.
does a strongly connected component have to have a loop if there it composed of more than on vertex
yes.
Define what the connectivity of the vertices is
it is the number of independent paths between two vertices.
What is a cut set
it is a set of vertices whose, removal will disconnect a specified pair of vertices.
