263 search results - page 38 / 53 » ejc 2007 |
EJC
2008
14 years 9 months ago
2008
We present improved lower bounds on the sizes of small maximal partial ovoids and small maximal partial spreads in the classical symplectic and orthogonal polar spaces, and improv...
EJC
2007
14 years 9 months ago
2007
In a paper of Klazar, several counting examples for rooted plane trees were given, including matchings and maximal matchings. Apart from asymptotical analysis, it was shown how to...
EJC
2007
14 years 9 months ago
2007
We examine the binary codes obtained from the row span over the field F2 of an adjacency matrix of the rectangular lattice graphs L2(m, n) for 3 ≤ m < n and show that permut...
EJC
2007
14 years 11 months ago
2007
This paper presents an information system architecture for the 7C model for organizational knowledge creation and management. The architecture is derived from the requirements that...
EJC
2007
14 years 9 months ago
2007
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...