547 search results - page 48 / 110 » dm 2008 |
DM
2008
15 years 1 months ago
2008
We discuss the relationship between the vertical connectivity of a biased graph and the Tutte connectivity of the frame matroid of (also known as the bias matroid of ).
DM
2008
15 years 1 months ago
2008
Beatty sequences n + are nearly linear, also called balanced, namely, the absolute value of the difference D of the number of el
83
Voted
DM
2008
15 years 1 months ago
2008
A sequence d = (d1, d2,
DM
2008
15 years 1 months ago
2008
By means of an exhaustive computer search we have proved that the strongly regular graphs with parameters (v, k, ,
103
click to vote
DM
2008
15 years 1 months ago
2008
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451