Sciweavers

DM
2011
273views Education» more  DM 2011»
13 years 6 months ago
The degree sequence of Fibonacci and Lucas cubes
The Fibonacci cube Γn is the subgraph of the n-cube induced by the binary strings that contain no two consecutive 1’s. The Lucas cube Λn is obtained
Sandi Klavzar, Michel Mollard, Marko Petkovsek
DM
2011
318views Education» more  DM 2011»
13 years 6 months ago
The Legendre-Stirling numbers
Abstract. The Legendre-Stirling numbers were discovered in 2002 as a result of a problem involving the spectral theory of powers of the classical second-order Legendre di¤erential...
George E. Andrews, Wolfgang Gawronski, Lance L. Li...
DM
2011
223views Education» more  DM 2011»
13 years 6 months ago
On graph equivalences preserved under extensions
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
Zbigniew Lonc, Miroslaw Truszczynski
DM
2011
264views Education» more  DM 2011»
13 years 6 months ago
Connectivity threshold and recovery time in rank-based models for complex networks
The World Wide Web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to an...
Pawel Pralat
DM
2011
228views Education» more  DM 2011»
13 years 6 months ago
The largest missing value in a composition of an integer
Archibald and Knopfmacher recently considered the largest missing value in a composition of an integer and established mean and variance. Our alternative, probabilistic approach p...
Margaret Archibald, Arnold Knopfmacher
DM
2011
249views Education» more  DM 2011»
13 years 6 months ago
Acyclic vertex coloring of graphs of maximum degree 5
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles.  The acyclic chromatic number of G, denoted ...
Kishore Yadav, Satish Varagani, Kishore Kothapalli...
DM
2011
209views Education» more  DM 2011»
13 years 6 months ago
Brun expansions of stepped surfaces
Valérie Berthé, Thomas Fernique
DM
2011
238views Education» more  DM 2011»
13 years 6 months ago
A combinatorial approach to height sequences in finite partially ordered sets
Fix an element x of a finite partially ordered set P on n elements. Then let hi(x) be the number of linear extensions of P in which x is in position i, counting from the bottom. T...
Csaba Biró, William T. Trotter
DM
2011
188views Education» more  DM 2011»
13 years 6 months ago
Singletons and adjacencies of set partitions of type B
We show that the joint distribution of the number of singleton pairs and the number of adjacency pairs is symmetric over the set partitions of type Bn without zero-block, in analo...
William Y. C. Chen, David G. L. Wang
DM
2011
192views Education» more  DM 2011»
13 years 6 months ago
Loose Hamilton cycles in hypergraphs
We prove that any k-uniform hypergraph on n vertices with minimum degree at least n 2(k−1) + o(n) contains a loose Hamilton cycle. The proof strategy is similar to that used by K...
Peter Keevash, Daniela Kühn, Richard Mycroft,...