Embedding cycles of various lengths into star graphs with both edge and vertex faults.
Ming-Chien YangPublished in: Appl. Math. Comput. (2010)
Keyphrases
- undirected graph
- edge weights
- vertex set
- weighted graph
- directed graph
- minimum weight
- graph embedding
- spanning tree
- approximation algorithms
- directed acyclic graph
- random graphs
- attributed graphs
- fault diagnosis
- graph structure
- fault detection
- complex networks
- labeled graphs
- edge information
- minimum cost
- vector space
- model based diagnosis
- average degree
- spectral embedding
- minimum spanning tree
- minimum spanning trees
- bipartite graph
- graph matching
- connected components
- edge detection
- multiple faults
- maximum cardinality
- image processing
- graph clustering
- geodesic distance
- adjacency graph
- hamiltonian cycle
- strongly connected
- graph theoretic
- connected subgraphs
- dimensionality reduction