The Maximum Spectral Radius of Graphs Without Friendship Subgraphs.
Sebastian M. CioabaLihua FengMichael TaitXiao-Dong ZhangPublished in: Electron. J. Comb. (2020)
Keyphrases
- graph mining
- graph databases
- spectral decomposition
- graph structures
- subgraph isomorphism
- labeled graphs
- subgraph matching
- link prediction
- graph properties
- subgraph mining
- maximum common subgraph
- frequent subgraph mining
- social networks
- graph data
- reachability queries
- spectral methods
- topological information
- social network analysis
- connected subgraphs
- maximum clique
- online social networks
- social networking
- dense subgraphs
- quasi cliques
- graph structure
- frequent subgraphs
- graph patterns
- graph matching
- social media
- spectral analysis
- query graph
- data structure
- laplacian matrix
- maximal cliques
- graph theoretic
- graph model
- graph theory
- pattern mining
- graph construction
- graph clustering
- graph partitioning
- spanning tree
- network analysis
- connected components
- network structure
- random walk