On vertex-stabilizers of bipartite dual polar graphs.
Stefko MiklavicPublished in: Ars Math. Contemp. (2010)
Keyphrases
- undirected graph
- vertex set
- bipartite graph
- graph model
- directed graph
- maximum cardinality
- graph partitioning
- attributed graphs
- labeled graphs
- minimum weight
- approximation algorithms
- edge weights
- graph structure
- connected components
- random graphs
- frequency domain
- fourier transform
- complex networks
- primal dual
- weighted graph
- minimum cost
- hamiltonian cycle
- adjacency matrix
- neural network
- graph matching
- rotation invariant
- graph theoretic
- directed acyclic graph
- graph representation
- spanning tree
- graph databases
- connected subgraphs
- small world
- graph kernels
- graph construction
- strongly connected
- bipartite networks