39 search results - page 1 / 8 » Construction of trees and graphs with equal domination param... |
DM
2006
13 years 4 months ago
2006
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
CP
2006
Springer
13 years 8 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
BMCBI
2006
13 years 4 months ago
2006
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...
WG
2004
Springer
13 years 10 months ago
2004
Springer
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
ICFP
2008
ACM
14 years 4 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...