The vertex isoperimetric problem for the powers of the diamond graph.
Sergei L. BezrukovMiquel RiusOriol SerraPublished in: Discret. Math. (2008)
Keyphrases
- graph partitioning
- directed graph
- undirected graph
- hamiltonian cycle
- labeled graphs
- minimum weight
- vertex set
- graph model
- betweenness centrality
- weighted graph
- edge weights
- graph theory
- strongly connected
- directed acyclic graph
- random walk
- attributed graphs
- graph structure
- bipartite graph
- connected components
- neural network
- graph theoretic
- graph representation
- structured data
- graph construction
- dependency graph
- spanning tree
- complex networks
- connected subgraphs