3008 search results - page 353 / 602 » Independence in connected graphs |
148
click to vote
COMBINATORICA
2006
15 years 6 months ago
2006
We prove that the out-distance sequence {f+ (k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+ (k + 1) f+ (k)2 for k 1, where f+ (k) denotes the numbe...
187
click to vote
EOR
2006
15 years 6 months ago
2006
: All information systems have to be protected. As the number of information objects and the number of users increase the task of information system's protection becomes more ...
148
Voted
INFORMATICALT
2006
15 years 6 months ago
2006
An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be m...
191
click to vote
JGT
2008
15 years 6 months ago
2008
: We develop a general model of edge spaces in order to generalize, unify, and simplify previous work on cycle spaces of infinite graphs. We give simple topological criteria to sho...
175
click to vote
DM
2007
15 years 6 months ago
2007
We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it...