|
|
A359989
|
|
Number of edge cuts in the n X n grid graph.
|
|
3
|
|
|
0, 11, 3665, 16222021, 1089224690733, 1150229180575982641, 19332960184149905415396841, 5191795779341747010730275139276101, 22300392508126626453613075681944644703634073, 1532492114568208344599582951444206568577948454351297761
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Edge Cut
|
|
FORMULA
|
|
|
EXAMPLE
|
The a(2) = 11 edge cuts are the following subgraphs and their rotations and reflections. The illustrations show the edge sets that must be removed to disconnect the graph.
o---o o---o o---o o---o
| | | |
o o o---o o---o o---o
The first two of these show minimal edge cuts.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|