Generalized matrix graphs and completely independent critical cliques in any dimension.
John J. LattanzioQuan ZhengPublished in: Discuss. Math. Graph Theory (2012)
Keyphrases
- completely independent
- graph structure
- maximal cliques
- weighted graph
- adjacency matrix
- maximum clique
- graph matching
- eigenvalues and eigenvectors
- graph theoretic
- eigenvalue decomposition
- graph theory
- rough approximations
- finite state
- graph partitioning
- clustering algorithm
- graph model
- graph mining
- bipartite graph
- eigenvalue problems
- spectral decomposition
- positive definite
- laplacian matrix
- association graph
- fully connected
- random graphs
- directed graph