Sciweavers

74 search results - page 8 / 15
» dam 2007
Sort
View
DAM
2007
85views more  DAM 2007»
13 years 10 months ago
Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
In this paper, we extend known relationships between Cayley digraphs and their subgraphs and coset graphs with respect to subgroups to obtain a number of general results on homomo...
Wenjun Xiao, Behrooz Parhami
DAM
2007
94views more  DAM 2007»
13 years 10 months ago
The harmonious coloring problem is NP-complete for interval and permutation graphs
In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
Katerina Asdre, Kyriaki Ioannidou, Stavros D. Niko...
DAM
2007
67views more  DAM 2007»
13 years 10 months ago
NP-completeness of generalized multi-Skolem sequences
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai position...
Gustav Nordh
DAM
2007
79views more  DAM 2007»
13 years 10 months ago
Necessary conditions for multistationarity in discrete dynamical systems
R. Thomas conjectured, twenty years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of severa...
Adrien Richard, Jean-Paul Comet
DAM
2007
76views more  DAM 2007»
13 years 10 months ago
Super-simple (v, 5, 4) designs
Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. Recently, Gronau et al determined the existence of super-si...
Kejun Chen, Ruizhong Wei