108 search results - page 10 / 22 » siamdm 2008 |
SIAMDM
2000
15 years 1 days ago
2000
A graph is a split graph if its vertices can be partitioned into a clique and a stable set. A graph is a k-split graph if its vertices can be partitioned into k sets, each of which...
109
Voted
SIAMDM
2002
14 years 12 months ago
2002
Let T be an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where...
115
click to vote
SIAMDM
2010
14 years 10 months ago
2010
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
94
Voted
SIAMDM
2010
14 years 10 months ago
2010
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in Rn . We show that the minimum distance is multipli...
SIAMDM
2008
15 years 5 days ago
2008
In [5], Reed conjectures that every graph satisfies ++1 2 . We prove this holds for graphs with disconnected complement. Combining this fact with a result of Molloy proves the co...