1993/07/01 by Elizabeth McMahon · 2 citations
Mathematics · #Graph theory and applications #Advanced Topics in Algebra #Stochastic processes and statistical mechanics #Combinatorics #Digraph #Mathematics #Discrete mathematics #Graph #Directed graph
paper · doi:10.1002/jgt.3190170316
openalex publication_date 1993/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
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.