ARSCOM
2008
13 years 11 months ago
2008
A total perfect code in a graph is a subset of the graph's vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove t...
ARSCOM
2007
14 years 17 days ago
2007
Let us denote by EX (m, n; {C4, . . . , C2t}) the family of bipartite graphs G with m and n vertices in its classes that contain no cycles of length less than or equal to 2t and h...
ARSCOM
2007
14 years 17 days ago
2007
We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.
ARSCOM
2007
14 years 17 days ago
2007
A subset D of the vertex set V of a graph is called an open oddd dominating set if each vertex in V is adjacent to an odd number of vertices in D (adjacency is irreflexive). In t...
ARSCOM
2007
14 years 17 days ago
2007
For any h ∈ N, a graph G = (V, E) is said to be h-magic if there exists a labeling l : E(G) → Zh − {0} such that the induced vertex labeling l+ : V (G) → Zh defined by l+ ...
ARSCOM
2007
14 years 17 days ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
ARSCOM
2007
14 years 17 days ago
2007
For any simple graph H, let σ(H, n) be the minimum m so that for any realizable degree sequence π = (d1, d2, . . . , dn) with sum of degrees at least m, there exists an n-vertex...
ARSCOM
2007
14 years 17 days ago
2007
ARSCOM
2007
14 years 17 days ago
2007
Consider a lottery scheme consisting of randomly selecting a winning t–set from a universal m–set, while a player participates in the scheme by purchasing a playing set of any...
ARSCOM
2007
14 years 17 days ago
2007
