The Toughness of a Toroidal Graph with Connectivity 3 and Girth 6 is Exactly 1.
Weiting CaoMichael J. PelsmajerPublished in: Graphs Comb. (2004)
Keyphrases
- connected components
- graph connectivity
- directed acyclic graph
- graph theory
- newly developed
- graph structure
- weighted graph
- graph model
- structured data
- graph representation
- topological information
- strongly connected
- random walk
- directed graph
- graph mining
- database
- graph databases
- graph theoretic
- graph clustering
- adjacency matrix