DM 2011 - PDF Preprint Papers

DM 2011

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DM-2011 Paper

click to vote

DM
2011

84views Education» more DM 2011»

The degree sequence of Fibonacci and Lucas cubes

1 years 9 days ago

Download www.fmf.uni-lj.si

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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	84	The degree sequence of Fibonacci and Lucas cubes	claim
2	79	The Legendre-Stirling numbers	claim
3	66	Singletons and adjacencies of set partitions of type B	claim
4	62	When linear and weak discrepancy are equal	claim
5	62	Diameter bounds for planar graphs	claim
6	60	Acyclic vertex coloring of graphs of maximum degree 5	claim
7	56	Two-ended regular median graphs	claim
8	56	Graphs of arbitrary excessive class	claim
9	55	Notes on lattice points of zonotopes and lattice-face polytopes	claim
10	55	A combinatorial approach to height sequences in finite partially ordered sets	claim
11	54	On permutations avoiding arithmetic progressions	claim
12	54	Brun expansions of stepped surfaces	claim
13	53	Coding discretizations of continuous functions	claim
14	52	On graph equivalences preserved under extensions	claim
15	51	The largest missing value in a composition of an integer	claim
16	50	Strongly regular graphs with non-trivial automorphisms	claim
17	50	Large cycles in 4-connected graphs	claim
18	50	On the hyperbolicity constant in graphs	claim
19	47	Loose Hamilton cycles in hypergraphs	claim
20	46	Digraphs that have at most one walk of a given length with the same endpoints	claim
21	46	Connectivity threshold and recovery time in rank-based models for complex networks	claim
22	43	A generalization of plexes of Latin squares	claim
23	40	Hall-Littlewood polynomials, alcove walks, and fillings of Young diagrams	claim
24	30	A survey of homogeneous structures	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers