The vertex connectivity of a {0, 2}-graph equals its degree.
Andries E. BrouwerHenry Martyn MulderPublished in: Discret. Math. (1997)
Keyphrases
- directed graph
- connected components
- strongly connected
- undirected graph
- labeled graphs
- random graphs
- minimum weight
- hamiltonian cycle
- graph connectivity
- edge weights
- attributed graphs
- random walk
- vertex set
- weighted graph
- graph representation
- spanning tree
- graph theoretic
- graph structure
- graph matching
- structured data
- graph databases
- graph based algorithm
- triangle mesh
- graph construction
- graph model
- graph mining
- graph theory
- average degree
- data sets
- search engine
- connected subgraphs
- degree distribution
- clustering coefficient
- graph partitioning
- bipartite graph
- complex networks
- binary images