Sciweavers

88
Voted
DM
2008
110views more  DM 2008»
15 years 23 days ago
A novel algorithm enumerating bent functions
By the relationship between the Walsh spectra at partial points and the Walsh spectra of its sub-functions, by the action of general linear group on the set of Boolean functions, ...
Qingshu Meng, Min Yang, Huanguo Zhang, Jingsong Cu...
78
Voted
DM
2008
91views more  DM 2008»
15 years 23 days ago
Further results on large sets of Kirkman triple systems
LR design is introduced by the second author in his recent paper, and it plays a very important role in the construction of LKTS (a large set of disjoint Kirkman triple system). I...
Lijun Ji, Jianguo Lei
54
Voted
DM
2008
54views more  DM 2008»
15 years 23 days ago
Strong edge-magic graphs of maximum size
Jim A. MacDougall, Walter D. Wallis
116
Voted
DM
2008
68views more  DM 2008»
15 years 23 days ago
Heavy cycles in k-connected weighted graphs with large weighted degree sums
A weighted graph is one in which every edge e is assigned a nonnegative number w(e), called the weight of e. The weight of a cycle is defined as the sum of the weights of its edge...
Bing Chen, Shenggui Zhang, T. C. Edwin Cheng
86
Voted
DM
2008
129views more  DM 2008»
15 years 23 days ago
On 3-regular 4-ordered graphs
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian...
Karola Mészáros
94
Voted
DM
2008
100views more  DM 2008»
15 years 23 days ago
Staircase tilings and k-Catalan structures
Many interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible generalization of the Catalan numbers. We will present a new combinatorial object that...
Silvia Heubach, Nelson Y. Li, Toufik Mansour
58
Voted
DM
2008
83views more  DM 2008»
15 years 23 days ago
Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
Camino Balbuena, Martín Cera, Ana Diá...
51
Voted
DM
2008
50views more  DM 2008»
15 years 23 days ago
On tree congestion of graphs
Stephen W. Hruska
49
Voted
DM
2008
49views more  DM 2008»
15 years 23 days ago
Linear choosability of graphs
Louis Esperet, Mickaël Montassier, Andr&eacut...
DM
2008
88views more  DM 2008»
15 years 23 days ago
Degree sequence and supereulerian graphs
A sequence d = (d1, d2,
Suohai Fan, Hong-Jian Lai, Yehong Shao, Taoye Zhan...