𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Families of vectors with prescribed rank partition and a prescribed subfamily

✍ Scribed by Amélia Fonseca

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
130 KB
Volume
305
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

family of vectors with prescribed rank partition and a prescribed subfamily.

📜 SIMILAR VOLUMES

Partitions of a graph into paths with pr
Partitions of a graph into paths with prescribed endvertices and lengths
✍ Hikoe Enomoto; Katsuhiro Ota 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 3 views

For a graph G, let ' 2 (G ) denote the minimum degree sum of a pair of nonadjacent vertices. We conjecture that if |V(G)| n i 1 k a i and ' 2 (G ) ! n k À 1, then for any k vertices v 1 , v 2 , F F F , v k in G, there exist vertex-disjoint paths P 1 , P 2 , F F F , P k such that |V (P i )| a i and v

Ranking and unranking of non-regular tre
Ranking and unranking of non-regular trees with a prescribed branching sequence
✍ Ro-Yu Wu; Jou-Ming Chang; Chir-Ho Chang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Ordered trees are called non-regular trees with a prescribed branching sequence (or nonregular trees for short) if their internal nodes have a pre-specified degree sequence in preorder list. This article presents two main results. First, we develop a simple algorithm to generate all non-regular tree

Infinite families of crossing-critical g
Infinite families of crossing-critical graphs with prescribed average degree and crossing number
✍ Drago Bokal 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB 👁 1 views

## Abstract Širáň constructed infinite families of __k__‐crossing‐critical graphs for every __k__⩾3 and Kochol constructed such families of simple graphs for every __k__⩾2. Richter and Thomassen argued that, for any given __k__⩾1 and __r__⩾6, there are only finitely many simple __k__‐crossing‐criti

The orders of graphs with prescribed deg
The orders of graphs with prescribed degree sets
✍ Timothy A. Sipka 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB 👁 1 views

## Abstract The degree set 𝒟^G^ of a graph __G__ is the set of degrees of the vertices of __G.__ For a finite nonempty set __S__ of positive integers, all positive integers __p__ are determined for which there exists a graph __G__ of order __p__ such that 𝒟^G^ = __S__.