Algebraic connectivity of layered path graphs under node deletion.
Ryusei YoshiseKaoru YamamotoPublished in: CDC (2022)
Keyphrases
- strongly connected
- finding the shortest path
- directed graph
- shortest path
- optimal path
- graph structure
- undirected graph
- edge weights
- fully connected
- node selection
- source node
- root node
- path length
- graph matching
- algebraic structures
- graph theoretic
- small world networks
- path planning
- topological information
- graph representation
- graph mining
- connected components
- topological features
- network connectivity
- graph databases
- link failure
- minimum cost
- destination node
- graph connectivity
- weighted graph
- nodes of a graph