547 search results - page 95 / 110 » dm 2008 |
84
Voted
DM
2008
15 years 24 days ago
2008
A homogeneous factorisation of a digraph consists of a partition P = {P1, . . . , Pk} of the arc set A and two vertex-transitive subgroups M G Aut() such that M fixes each Pi set...
59
Voted
DM
2008
15 years 24 days ago
2008
Rahilly [10] described a construction that relates any Hadamard design H on 4m -1 points with a line spread to an affine design having the same parameters as the classical design ...
113
Voted
DM
2006
15 years 23 days ago
2006
For a chordal graph G = (V, E), we study the problem of whether a new vertex u V and a given set of edges between u and vertices in V can be added to G so that the resulting grap...
98
Voted
DM
2006
15 years 23 days ago
2006
Pattern Sturmian words introduced by Kamae and Zamboni KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two k...
104
click to vote
DM
2006
15 years 23 days ago
2006
An L(h, k)-labeling of a graph G is an integer labeling of vertices of G, such that adjacent vertices have labels which differ by at least h, and vertices at distance two have lab...