Graph theory: Every vertex belongs to some component of the graph -


i know intuitively, every vertex of undirected graph must belong component of graph, since @ least, every vertex of graph connected itself. how can proven formally?

consider operator ~ on vertices in (possibly infinite) graph g, v1 ~ v2 iff there path between v1 , v2 (and allowing v ~ v). ~ equivalence relation on vertices(g), since reflexive, symmetric , transitive (you should verify each of these properties).

by definition of component, each equivalence class in vertices(g)/~ associated 1 component of g, , contains vertices of associated component. equivalence classes form partition of sets on defined, each vertex of g in @ least 1 equivalence class, , hence in 1 component.


Comments

Popular posts from this blog

node.js - How to mock a third-party api calls in the backend -

java - Could not locate OpenAL library -

Non Unique Username with ASP.Net Identity 2.0 -