18 search results - page 2 / 4 » arscom 2008 |
ARSCOM
2008
13 years 5 months ago
2008
ARSCOM
2008
13 years 5 months ago
2008
ARSCOM
2008
13 years 5 months ago
2008
A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the least number of vertices. In this note, we show that (k; g)-cage has an r-factor of girt...
ARSCOM
2008
13 years 4 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
2008
13 years 5 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...