✦ LIBER ✦

On the polynomial of a path

✍ Scribed by Robert A. Beezer

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 258 KB
Volume: 63
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(84)90144-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path polynomials of a graph

✍ Ronghua Shi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 215 KB

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

On the Zeroes of a Polynomial

✍ H. Alzer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 70 KB

Counting of paths and coefficients of th

Counting of paths and coefficients of the Hilbert polynomial of a determinantal ideal

✍ Devadatta M. Kulkarni 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 723 KB

Let x = Cxijll $i<m be an m x n of matrix of indeterminates over a field K. Abhyankar IGj<n defines the index of a monomial in Xij to be the largest k such that the principal diagonal of some k x k minor of X divides the given monomial. Abhyankar has given a formula for counting the set of monomials

On the Smallest Divisor of a Polynomial

✍ Maurice Mignotte; Philippe Glesser 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 129 KB

On the Cover Polynomial of a Digraph

✍ F.R.K. Chung; R.L. Graham 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 511 KB