|
Search: id:A124157
|
|
|
| A124157 |
|
Maximal number of edges in a doubly linear graph with n nodes. |
|
+0
2
|
| |
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
a(9) is known to be 34 or 35. I have put 35 here so as to distinguish this sequence from the triangular numbers. But the true value is (or was in 1997 at least) not known.
|
|
REFERENCES
|
L. W. Beineke, Biplanar graphs: a survey, Computers Math. Applic., 34 (1997), 1-8.
Hutchinson, Joan P.; Shermer, Thomas; and Vince, Andrew; On representations of some thickness-two graphs. Comput. Geom. 13 (1999), 161-171.
|
|
FORMULA
|
For n >= 10, 6n-20 <= a(n) <= 6n-18.
|
|
CROSSREFS
|
Sequence in context: A054636 A124158 A109444 this_sequence A033440 A067525 A130487
Adjacent sequences: A124154 A124155 A124156 this_sequence A124158 A124159 A124160
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
njas, Dec 02 2006
|
|
|
Search completed in 0.002 seconds
|
