On the bipartition of graphs (Q796548): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q106822479, #quickstatements; #temporary_batch_1704595273857 |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 11:05, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the bipartition of graphs |
scientific article |
Statements
On the bipartition of graphs (English)
0 references
1984
0 references
The isoperimetric constant i(G) of a cubic graph G is \(i(G)=\min | \partial U| /| U|\) where \(|.|\) is cardinality, U runs over all subsets of the vertex set VG satisfying \(| U| \leq {1\over2}| VG|\), and \(| \partial U|\) is the number of edges running from U to the complement V\(G\backslash U\). The spectral theory on Riemann surfaces is used to prove that infinitely many cubic graphs G exist satisfying i(G)\(\geq 1/128\).
0 references
cubic graphs
0 references
isoperimetric problems
0 references
eigenvalues of the Laplacian
0 references