Expected rank and randomness in rooted graphs

DOI10.1016/J.DAM.2007.08.012zbMATH Open1134.05097OpenAlexW2014995222MaRDI QIDQ2476261FDOQ2476261

Authors: David Eisenstat, Jennifer Feder, Greg Francos, Gary Gordon, Amanda Redlich 

Publication date: 18 March 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.012

Recommendations

• Expected value expansions in rooted graphs
• Distinguished vertices in probabilistic rooted graphs
• New expected value expansions of rooted graphs
• Combinatorial Properties of a Rooted Graph Polynomial
• When bad things happen to good trees

zbMATH Keywords

random treesprobabilistic graphexpected rankrooted digraphs

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80)

Cites Work

• Tutte polynomials for trees
• Combinatorial Properties of a Rooted Graph Polynomial
• Network Resilience
• When bad things happen to good trees
• Expected rank in antimatroids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Expected value expansions in rooted graphs

Cited In (7)

• Distinguished vertices in probabilistic rooted graphs
• New expected value expansions of rooted graphs
• Expected value expansions in rooted graphs
• Combinatorial Properties of a Rooted Graph Polynomial
• Expected rank in antimatroids
• When bad things happen to good trees
• Expected values of parameters associated with the minimum rank of a graph

This page was built for publication: Expected rank and randomness in rooted graphs

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