Web Science/Part2: Emerging Web Properties/Modeling the Web as a graph/Reviewing terms from graph theory/quiz

1 Which of these terms describe the axioms for a bipartite graph $G(V,E)$ with $U_{1},U_{2}$ being the disjoint split of the vertices?

	$\forall e=(u,v)\in E:\exists w\in V:(u,w),(w,u)\in E$
	$\forall e=(u,v)\in E:(v,u)\in E$
	$\forall e=(u,v)\in E:u\in U_{1}\land v\in U_{2}\lor v\in U_{1}\land u\in U_{2}$
	$\forall e=(u,v)\in E:u\in U_{1}\lor v\in U_{2}\land v\in U_{1}\lor u\in U_{2}$
	$\forall e=(u,v)\in E:u\in U_{1}\lor v\in U_{2}\lor v\in U_{1}\lor u\in U_{2}$

2 What kind of mathematical object is used to describe a graph labeling?

	set
	element
	function
	matrix
	vector
	String

3 which of the following are types of graphs that you know?

	heavy graphs
	complex graphs
	directed graphs
	difficult graphs
	bipartite graphs
	robust graphs
	web graphs
	weighted graphs