14 search results - page 2 / 3 » Degree sum and connectivity conditions for dominating cycles |
188
click to vote
JCT
2010
15 years 5 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
160
click to vote
ASAP
2007
IEEE
16 years 1 months ago
2007
IEEE
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
169
click to vote
DM
2002
15 years 6 months ago
2002
A generalized p-cycle is a digraph whose set of vertices can be partitioned into p parts that are cyclically ordered in such a way that the vertices in one part are adjacent only ...
182
click to vote
MOBIHOC
2005
ACM
16 years 6 months ago
2005
ACM
: In this paper, we analyze the node scheduling approach of topology control in the context of reliable packet delivery. In node scheduling, only a minimum set of nodes needed for ...
159
click to vote
FCCM
2006
IEEE
16 years 23 days ago
2006
IEEE
— Dedicated, spatially configured FPGA interconnect is efficient for applications that require high throughput connections between processing elements (PEs) but with a limited ...