๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The S2NS Digraphs and the Cycle Linear System of a Digraph

โœ Scribed by Jian-guo Qian; Sheng-jun Miao

Book ID
106301534
Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2002
Tongue
English
Weight
166 KB
Volume
18
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Path-Cycle Symmetric Function of a D
The Path-Cycle Symmetric Function of a Digraph
โœ Timothy Y. Chow ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 885 KB

## Introduction Recently, Stanley [21] has defined a symmetric function generalization of the chromatic polynomial of a graph. Independently, Chung and Graham have defined a digraph polynomial called the cover polynomial which is closely related to the chromatic polynomial of a graph (in fact, as

The Cycle-Path Indicator Polynomial of a
The Cycle-Path Indicator Polynomial of a Digraph
โœ Ottavio M. D'Antona; Emanuele Munarini ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 126 KB

A cycle-path cover of a digraph D is a spanning subgraph made of disjoint cycles and paths. In order to count such covers by types we introduce the cyclepath indicator polynomial of D. We show that this polynomial can be obtained by a deletion-contraction recurrence relation. Then we study some spec

A characterization of the minimum cycle
A characterization of the minimum cycle mean in a digraph
โœ Richard M. Karp ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 315 KB

Let C = (V, E) be a digraph wl,th n vertices. Let f be a function from E illto the real numbem, associating with each edg~t: e EE a weight f(e). Given any sequence of edges 0 = el, e2, , . . , ep define w(a), the wei@ of a, as CyS 1 f(q), and define m(o), the mean weight of u, as w(a)&. Let A\* ==mi