Here we are going to repeat basics of graphs, connectivity and walks.
You can revize terms by using flashcards.
Choose the correct term.
1. A graph which edges are ordered pairs of different nodes.
2. An edge whose endpoints are the same vertex.
3. Consider an edge e=ab of a graph (directed or undirected). The vertices a and b are ... with the edge e.
4. A vertex with degree 0.
5. A graph where all vertices are pairwise adjacent.
6. A subgraph of a graph G containing all vertices of G.
7. A walk where first and last vertices are the same.
8. Two graphs that are not distinguished because they have the same structure.
9. An open walk in which all the edges are different.
10. The number of edges in the walk <u,v>.
To perform the task, you should know more then terms.
Marc correct and incorrect statements.
In a nontrivial simple graph...
For every bipartite graph having M vertices in one part and N vertices in another part ...
The number of non-isomorphic...
For a simple graph with N vertices and K connectivity components,
A directed graph...
What is true about walks?
Watch this video and fill the gaps with the words below. You can use a word more than once.
odd field even trivial two all lines new degree node Geometry graph mathematics Position seven route four degrees path point once mathematician more two
© Yulia Burkatovskaya, Tomsk Polytechnic University, 2017Created using the LOC Tool, University of Southampton