A proof of unimodality on the numbers of connected spanning subgraphs in an n-vertex graph with at least ... edges.
Peng ChengShigeru MasuyamaPublished in: Discret. Appl. Math. (2010)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- edge weights
- vertex set
- graph properties
- connected subgraphs
- connected components
- graph structures
- weighted graph
- directed acyclic graph
- spanning tree
- graph databases
- graph mining
- strongly connected
- random walk
- dense subgraphs
- minimum weight
- real world graphs
- bipartite graph
- similarity function
- hamiltonian cycle
- graph structure
- subgraph mining
- data structure
- massive graphs
- frequent subgraphs
- reachability queries
- random graphs
- graph search
- edge detector
- graph data
- approximation algorithms
- directed edges
- binary images
- regular expressions
- frequent subgraph mining
- spectral embedding
- theorem prover
- graph theoretic
- graph patterns
- attributed graphs
- minimum cost
- complex networks
- quasi cliques
- topological information