✦ LIBER ✦

On the greedoid polynomial for rooted graphs and rooted digraphs

✍ Scribed by Elizabeth W. McMahon

Publisher: John Wiley and Sons
Year: 1993
Tongue: English
Weight: 499 KB
Volume: 17
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190170316

No coin nor oath required. For personal study only.

✦ Synopsis

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 digraph has a directed cycle. © 1993 John Wiley & Sons, Inc.

📜 SIMILAR VOLUMES

The Isomorphism Problem For Directed Pat

The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs

✍ L. Babel; I.N. Ponomarenko; G. Tinhofer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 237 KB

This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path

On the Roots of Orthogonal Polynomials a

On the Roots of Orthogonal Polynomials and Euler-Frobenius Polynomials

✍ F. Dubeau; J. Savoie 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 433 KB

On the Sendov Conjecture for Polynomials

On the Sendov Conjecture for Polynomials with at Most Six Distinct Roots

✍ Iulius Borcea 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 229 KB

In this paper we prove that Sendov's conjecture is true for polynomials of degree Ž . n s 6 we even determine the so-called extremal polynomials in this case , as well as for polynomials with at most six different zeros. We then generalize this last Ž . Ž . result to polynomials of degree n with at

Complexity results on the minimum width

Complexity results on the minimum width drawing problem for rooted unordered trees

✍ Kunihiko Hayashi; Sumio Masuda 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 960 KB

Real Polynomials with All Roots on the U

Real Polynomials with All Roots on the Unit Circle and Abelian Varieties over Finite Fields

✍ Stephen A. DiPippo; Everett W. Howe 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 376 KB

In this paper we prove several theorems about abelian varieties over finite fields by studying the set of monic real polynomials of degree 2n all of whose roots lie on the unit circle. In particular, we consider a set V n of vectors in R n that give the coefficients of such polynomials. We calculate

CORRIGENDUM: Volume 73, Number 2 (1998),

CORRIGENDUM: Volume 73, Number 2 (1998), in the article “Real Polynomials with All Roots on the Unit Circle and Abelian Varieties over Finite Fields,” by Stephen A. DiPippo and Everett W. Howe, pages 426–450

📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 27 KB

The expression q n(n&1)Â4 should be replaced with the expression q (n+2)(n&1)Â4 in the first displayed equation in the statement of Theorem 1.2 (page 427), as well as in the first displayed equation in the statement of Proposition 3.2.1 (page 445) and in the displayed equation at the bottom of page