Algebraic connectivity of layered path graphs under node deletion.
Ryusei YoshiseKaoru YamamotoPublished in: CoRR (2022)
Keyphrases
- strongly connected
- finding the shortest path
- directed graph
- shortest path
- graph structure
- undirected graph
- optimal path
- root node
- source node
- edge weights
- fully connected
- connected components
- topological information
- spanning tree
- path length
- algebraic structures
- topological properties
- destination node
- graph partitioning
- minimum cost
- nodes of a graph
- graph matching
- packet transmission
- node selection
- graph clustering
- small world networks
- topological features
- community discovery
- random graphs
- social networks
- graph theoretic
- graph representation
- bipartite graph
- bayesian networks