The number of a vertex connection, the number of an edge connection is the minimum number of vertices and edges, respectively, after removing which the graph will become one-vertex or disconnected.
The number of independence, matching, rib and top cover.
The independence number is the power of the largest set of independent vertices, i.e. vertices not connected with any other.
The number of matching is the same as the number of independence, but for the edges.
The number of vertex cover is the power of the smallest set of vertices covering each edge of the graph. Ie. each edge contains at least one vertex of this set.
Similarly, for edges, the number of edge connections.
Moreover, the number of matching + the number of edge connectivity, if I am not mistaken, is equal to the cardinality of the set of vertices of the graph.
Independence number + number of vertex coverage = cardinality of the vertex set of the graph.
I hope this is enough. I would not add, but you can still chromatic index and chromatic number.
Comments
To leave a comment
Discrete Math. Set theory. Graph theory. Combinatorics.
Terms: Discrete Math. Set theory. Graph theory. Combinatorics.