Invulnerability of planar two-tree networks
From MaRDI portal
Publication:1733045
DOI10.1016/j.tcs.2018.09.021zbMath1417.68165OpenAlexW2893205929MaRDI QIDQ1733045
Yaping Mao, Yuzhi Xiao, Guan-Rong Chen, Hai-xing Zhao
Publication date: 26 March 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.09.021
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (4)
Enumeration of subtrees of planar two-tree networks ⋮ A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Nonexistence of uniformly most reliable two-terminal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs
- Weighted restrained domination in subclasses of planar graphs
- Lower and upper bounds for long induced paths in 3-connected planar graphs
- Vulnerability of super edge-connected networks
- Vulnerability of complex networks
- A local approximation algorithm for minimum dominating set problem in anonymous planar networks
- Spanning trees on the Sierpinski gasket
- Enumeration of connected spanning subgraphs of a planar graph
- New method for counting the number of spanning trees in a two-tree network
- Finding a maximum-density path in a tree under the weight and length constraints
- On the roots of all-terminal reliability polynomials
- Label-based routing for a family of scale-free, modular, planar and unclustered graphs
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- On unreliability polynomials and graph connectivity in reliable network synthesis
- On the Number of Spanning Trees a Planar Graph Can Have
- The Complexity of Reliability Computations in Planar and Acyclic Graphs
- On reliability of graphs with node failures
- A proof of Boesch's conjecture
- On the existence of uniformly optimally reliable networks
- Algorithms and Computation
This page was built for publication: Invulnerability of planar two-tree networks
