𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Cover Polynomial of a Digraph

✍ Scribed by F.R.K. Chung; R.L. Graham

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
511 KB
Volume
65
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Factorization of the Cover Polynomial
Factorization of the Cover Polynomial
✍ Morris Dworkin πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 496 KB

Chung and Graham's cover polynomial is a generalization of the factorial rook polynomial in which the second variable keeps track of cycles. We factor the cover polynomial completely for Ferrers boards with either increasing or decreasing column heights. For column-permuted Ferrers boards, we find a

On the greedoid polynomial for rooted gr
On the greedoid polynomial for rooted graphs and rooted digraphs
✍ Elizabeth W. McMahon πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 499 KB

## Abstract We examine some properties of the 2‐variable greedoid polynomial __f__(__GΒ·,t,z__) when __G__ is the branching greedoid associated to a rooted graph or a rooted directed graph. For rooted digraphs, we show a factoring property of __f__(__GΒ·,t,z__) determines whether or not the rooted di

On the Ferrers dimension of a digraph
On the Ferrers dimension of a digraph
✍ Olivier Cogis πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 714 KB

The Ferrer-s dimension of a digraph has been shown to be an extension of the order dimension. By proving a property of (finite) transitive Ferrers digraphs, we give an original proof of this above result and derive Ore's alternative definition of the order dimension. Still, the order dimension is pr

The characteristic polynomial of ladder
The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem
✍ Chong-Keang Lim; Kah Seng Lam πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 207 KB

Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomialf(x) of degree at most n is called an annihilating polynomial of G iff(A(G)) = O. G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. In this paper, we give the explicit express