On the connectivity of p-diamond-free vertex transitive graphs.
Yingzhi TianJixiang MengZhao ZhangPublished in: Discret. Appl. Math. (2012)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- attributed graphs
- hamiltonian cycle
- strongly connected
- connected components
- graph matching
- topological information
- series parallel
- graph theory
- transitive closure
- maximum cardinality
- connected subgraphs
- graph theoretic
- data sets
- edge weights
- graph representation
- graph kernels
- graph mining
- weighted graph
- betweenness centrality
- graph structure
- topological properties
- preference relations
- spanning tree
- triangle mesh
- vertex set
- neural network