Which non-regular bipartite integral graphs with maximum degree four do not have pm1 as eigenvalues?
Krystyna T. BalinskaSlobodan K. SimicKrzysztof T. ZwierzyskiPublished in: Discret. Math. (2004)
Keyphrases
- graph model
- bipartite graph
- graph partitioning
- undirected graph
- random graphs
- graph representation
- eigenvalues and eigenvectors
- graph theoretic
- graph databases
- covariance matrix
- graph matching
- real valued
- graph mining
- adjacency matrix
- singular value decomposition
- graph clustering
- laplacian matrix
- symmetric matrices
- vertex set
- spanning tree
- power law
- complex structures
- neural network
- directed graph
- sample size
- support vector
- feature selection
- genetic algorithm