Some characterizations of strongly regular graphs with respect to their vertex deleted subgraphs.
Mirko LepovicPublished in: Discret. Math. (2010)
Keyphrases
- labeled graphs
- connected subgraphs
- graph databases
- graph mining
- undirected graph
- directed graph
- subgraph matching
- graph properties
- biological networks
- attributed graphs
- graph theoretic
- reachability queries
- graph structures
- subgraph isomorphism
- maximum common subgraph
- graph data
- graph patterns
- hamiltonian cycle
- similarity function
- directed acyclic graph
- vertex set
- frequent subgraphs
- frequent subgraph mining
- graph kernels
- subgraph mining
- graph matching
- dense subgraphs
- minimum weight
- graph theory