Distinguished vertices in probabilistic rooted graphs

DOI10.1002/net.20363zbMath1208.05134OpenAlexW4233332066MaRDI QIDQ3057145

Ekaterina Jager, Gary Gordon

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20363

zbMATH Keywords

reliabilityprobabilistic graphoptimal vertex location

Mathematics Subject Classification ID

Graph polynomials (05C31) Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• The optimal unicyclic graphs for pair-connected reliability
• Expected value expansions in rooted graphs
• On the chromatic roots of generalized theta graphs
• Expected rank and randomness in rooted graphs
• When bad things happen to good trees
• Uniformly-most reliable networks do not always exist
• Combinatorial Properties of a Rooted Graph Polynomial
• Expected Value Expansions in Random Subgraphs with Applications to Network Reliability
• Crossing properties of graph reliability functions
• Random Graphs
• On chromatic polynomials and the golden ratio
• Chromatic polynomials and their zeros and asymptotic limits for families of graphs

This page was built for publication: Distinguished vertices in probabilistic rooted graphs