Jump to Content
Your Recent History
View Cart
Logged Out Log In
SIAM J. Discrete Math. 22, pp. 776-785 (10 pages)
Combinatorial Properties of a Rooted Graph Polynomial
Alerts
Alert Me When Cited
Alert Me When Corrected
Tools
Download Citation
Add to MyScitation
Blog This Article
Print-Friendly
Research Toolkit
Share
Email Abstract
Connotea
CiteULike
del.icio.us
BibSonomy
Tweet this Article
Add to FacebookFor a rooted graph $G$, let $EV(G;p)$ be the expected number of vertices reachable from the root when each edge has an independent probability $p$ of operating successfully. We examine combinatorial properties of this polynomial, proving that $G$ is $k$-edge connected if and only if $EV'(G;1)=\cdots=EV^{k-1}(G;1)=0$. We find bounds on the first and second derivatives of $EV(G;p)$; applications yield characterizations of rooted paths and cycles in terms of the polynomial. We prove reconstruction results for rooted trees and a negative result concerning reconstruction of more complicated rooted graphs. We also prove that the norm of the largest root of $EV(G;p)$ in $\mathbb{Q}[i]$ gives a sharp lower bound on the number of vertices of $G$.
© 2008 Society for Industrial and Applied Mathematics
For access to fully linked references, you need to log in.
ALL SIAM Content
Scitation
Google Scholar