Distinguished vertices in probabilistic rooted graphs
From MaRDI portal
Recommendations
Cites work
- Chromatic polynomials and their zeros and asymptotic limits for families of graphs
- Combinatorial Properties of a Rooted Graph Polynomial
- Crossing properties of graph reliability functions
- Expected rank and randomness in rooted graphs
- Expected Value Expansions in Random Subgraphs with Applications to Network Reliability
- Expected value expansions in rooted graphs
- scientific article; zbMATH DE number 4065011 (Why is no real title available?)
- scientific article; zbMATH DE number 4091558 (Why is no real title available?)
- On chromatic polynomials and the golden ratio
- On the chromatic roots of generalized theta graphs
- Random Graphs
- The optimal unicyclic graphs for pair-connected reliability
- Uniformly-most reliable networks do not always exist
- When bad things happen to good trees
Cited in
(6)
This page was built for publication: Distinguished vertices in probabilistic rooted graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3057145)