SMA
SMA Unimib
SMA Unimib
Kartei Details
| Karten | 287 |
|---|---|
| Sprache | Deutsch |
| Kategorie | Technik |
| Stufe | Universität |
| Erstellt / Aktualisiert | 06.12.2023 / 15.01.2024 |
| Weblink |
https://card2brain.ch/box/20231206_sma
|
| Einbinden |
<iframe src="https://card2brain.ch/box/20231206_sma/embed" width="780" height="150" scrolling="no" frameborder="0"></iframe>
|
What are regular graphs?
regular graphs, also k-regular graphs, are graphs were alle vertices have the same degree.
What are null graphs?
Null graphs, or 0-degree graphs, are graphs made up by only isolated vertices.
What is a complete graph?
What is the in-degree?
What is the in-degree of v?
The in-degree (grado in entrata) din(v) of a vertex v is the number of edges arriving at the v vertex (incoming edges)
What is the out-degree?
What is the out-degree of v?
The out-degree dout(v) of a vertex v is the number of edges starting from the vertex v (outgoing edges)
What is the degree of a vertex in a directed graph?
The sum of the number of its incoming and outgoing edges.
What is a subgraph?
What is edge deletion?
What is vertex deletion?
What is a walk?
In a simple graph (no multiple arcs) a walk is sequence of vertices (no need of listing the vertices)
What walk types are there?
What is a directed walk?
What are closed walks, cyles and circuits?
What are the following?
What are some concepts and metrics of walks?
What is a connected graph?
What is connectivity?
What is a bridge?
What is an articulation point?
What are connected components?
What articulation points does this graph have and which connected components would the removal of the articulation points create?
What bridges does this graph have?
v4,v7
What is biconectivity?
How could this graph become biconnected?
How does connectivity work for directed graphs?
Two vertices are said to be connected if there exists a directed path from one vertex to the other
What is a strongly connected component?
How many strongly connected components does this graph have?
What is a disconnected directed graph?
what are articulation points and bridges in directed graphs?
What are cliques and which types are there?
What cliques are in this graph?
How do cliques work in a directed graph?
What is the clustering coefficient?
What is the difference of the clustering coefficient in directed vs undirected graphs?
How is the local clustering coefficient calculated?
Calculate the local clustering coeffient.
How is average clustering coefficient calculated?
Calculate the average clustering coefficient for these two graphs.
What is the global clustering coefficient?
Which closed and open triples are present in this graph?
How is the global cluster coefficient calculated?
What is the global clustering coefficient of this graph?
