Almost all cop-win graphs contain a universal vertex.
Anthony BonatoGraeme KemkesPawel PralatPublished in: Discret. Math. (2012)
Keyphrases
- undirected graph
- directed graph
- labeled graphs
- attributed graphs
- maximum cardinality
- hamiltonian cycle
- vertex set
- graph matching
- graph theoretic
- minimum weight
- weighted graph
- edge weights
- average degree
- bipartite graph
- social networks
- random walk
- genetic algorithm
- graph theory
- connected subgraphs
- betweenness centrality
- knn
- complex networks
- strongly connected
- online communities
- graph structures
- graph clustering
- data mining
- graph partitioning