Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors.
Yahya Ould HamidouneAnna S. LladóSusana-Clara LópezPublished in: J. Graph Theory (2011)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- attributed graphs
- hamiltonian cycle
- vertex set
- nearest neighbor
- data mining
- neural network
- connected subgraphs
- graph theoretic
- complex structures
- transitive closure
- edge weights
- strongly connected
- graph theory
- bayesian networks
- case study
- learning algorithm
- betweenness centrality
- average degree
- database
- maximum cardinality