5 search results - page 1 / 1 » Bipartite Subgraphs And The Smallest Eigenvalue |
62
Voted
CPC
2000
14 years 10 months ago
2000
COMBINATORICS
2007
14 years 10 months ago
2007
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) Let G be a regular graph of order n and finite di...
COMBINATORICS
2007
14 years 10 months ago
2007
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) If H is a proper subgraph of a connected graph G o...
DAM
2010
14 years 10 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
HICSS
2008
IEEE
15 years 4 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...