Combinatorial Properties of a Rooted Graph Polynomial

DOI10.1137/06065951XMaRDI QIDQ3629475zbMATH OpenFDO

Authors David Eisenstat, Gary Gordon, Amanda Redlich

Publication date 27 May 2009

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/06065951X

zbMATH Keywords

cyclesprobabilistic graphrooted graphrooted pathsrooted treesexpected rank

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40) Stochastic network models in operations research (90B15)

Recommendations

• Expected value expansions in rooted graphs
• Distinguished vertices in probabilistic rooted graphs
• Expected rank and randomness in rooted graphs
• New expected value expansions of rooted graphs
• Roots of the Reliability Polynomials

Cited in

(10)

• Distinguished vertices in probabilistic rooted graphs
• A characteristic polynomial for rooted mixed graphs
• New expected value expansions of rooted graphs
• Combinatorial properties of the G-degree
• Expected value expansions in rooted graphs
• Expected rank and randomness in rooted graphs
• Factorisation of greedoid polynomials of rooted digraphs
• When bad things happen to good trees
• The average expected value of a rooted graph, Monte Carlo calculation, and a power index for the voting game
• scientific article; zbMATH DE number 7583268 (Why is no real title available?)

This page was built for publication: Combinatorial Properties of a Rooted Graph Polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3629475)