### Abstract

Given a uniform probability <formula><tex>$\rho, 0 < \rho < 1$</tex></formula>, of selecting edges independently from a graph <formula><tex>$G$</tex></formula>, we define the edge cover probability polynomial <formula><tex>$Ep(G, \rho)$</tex></formula> of <formula><tex>$G$</tex></formula> to be the probability of randomly selecting an edge cover of <formula><tex>$G$</tex></formula>. We provide general, and in some cases specific, formulas for obtaining <formula><tex>$Ep(G, \rho)$</tex></formula>. We then demonstrate the existence of graphs which have either the largest or the smallest <formula><tex>$Ep(G, \rho)$</tex></formula> within its class for all ρ. The classes we consider are trees, unicyclic graphs, and connected graphs having one more edge than the number of vertices. Thus we determine the optimal constructions with respect to edge covers within the context of these classes.

Original language | English (US) |
---|---|

Journal | IEEE Transactions on Network Science and Engineering |

DOIs | |

State | Accepted/In press - Mar 26 2018 |

### All Science Journal Classification (ASJC) codes

- Control and Systems Engineering
- Computer Science Applications
- Computer Networks and Communications