Sciweavers

547 search results - page 42 / 110
» dm 2008
Sort
View
DM
2006
85views more  DM 2006»
15 years 4 months ago
Further analysis of the number of spanning trees in circulant graphs
Let 1 s1 < s2 <
Talip Atajan, Xuerong Yong, Hiroshi Inaba
95
Voted
DM
2006
80views more  DM 2006»
15 years 4 months ago
A class of combinatorial identities
A general theorem for providing a class of combinatorial identities where the sum is over all the partitions of a positive integer is proven. Five examples as the applications of ...
Yingpu Deng
DM
2006
89views more  DM 2006»
15 years 4 months ago
On the direct limit of a direct system of multialgebras
We will present some properties of the direct limit of a direct system of multialgebras in a subcategory of the category of multialgebras obtained by considering as morphisms the i...
Cosmin Pelea
DM
2007
63views more  DM 2007»
15 years 4 months ago
On Sloane's generalization of non-squashing stacks of boxes
Recently, Sloane and Sellers solved a certain box stacking problem related to non– squashing partitions. These are defined as partitions n = p1 + p2 + · · · + pk with
George E. Andrews, James A. Sellers
DM
2000
91views more  DM 2000»
15 years 3 months ago
Perfection thickness of graphs
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.
Hirotsugu Asari, Tao Jiang, André Künd...