✦ LIBER ✦

Free Cumulants and Enumeration of Connected Partitions

✍ Scribed by Franz Lehner

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 193 KB
Volume: 23
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.2002.0619

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of connected graph coverings

✍ Kwak, Jin Ho; Lee, Jaeun 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 1 views

The number of the isomorphism classes of n-fold coverings of a graph G is enumerated by the authors (Canad.

Refined Stirling Numbers: Enumeration of

Refined Stirling Numbers: Enumeration of Special Sets of Permutations and Set-Partitions

✍ J. Katriel 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 110 KB

The refined Stirling numbers of the first kind specify the number of permutations of n indices possessing m i cycles whose lengths modulo k are congruent to i; i ¼ 0; 1; 2; . . . ; k À 1: The refined Stirling numbers of the second kind are similarly defined in terms of set-partitions and the cardi

Partition, Construction, and Enumeration

Partition, Construction, and Enumeration of M–P Invertible Matrices over Finite Fields

✍ Zongduo Dai; Yufeng Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 314 KB

A necessary and su$cient condition for an m;n matrix A over F O having a Moor}Penrose generalized inverse (M}P inverse for short) was given in (C. K. Wu and E. Dawson, 1998, Finite Fields Appl. 4, 307}315). In the present paper further necessary and su$cient conditions are obtained, which make clear

Prolog program for subgraph enumeration

Prolog program for subgraph enumeration and calculation of molecular connectivity indexes

✍ Kei Takeuchi; Chiaki Kuroda; Masaru Ishida 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 452 KB

Prolog is applied to calculate the zero-through the sixth-order molecular connectivity indexes. A description of the program is given. Enumeration of substructure fragments, which is the most timeconsuming part for this calculation, can be executed quite compactly by Prolog. For this execution, mole

Non-traceability of large connected claw

Non-traceability of large connected claw-free graphs

✍ Frydrych, Wac?w; Skupie?, Zdzis?aw 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 3 views

Let G be a connected claw-free graph on n vertices. Let σ 3 (G) be the minimum degree sum among triples of independent vertices in G. It is proved that if σ 3 (G) ≥ n-3 then G is traceable or else G is one of graphs G n each of which comprises three disjoint nontrivial complete graphs joined togethe

On factors of 4-connected claw-free grap

On factors of 4-connected claw-free graphs

✍ H. J. Broersma; M. Kriesell; Z. Ryjác̆ek 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB

## Abstract We consider the existence of several different kinds of factors in 4‐connected claw‐free graphs. This is motivated by the following two conjectures which are in fact equivalent by a recent result of the third author. Conjecture 1 (Thomassen): Every 4‐connected line graph is hamiltonian,