On unreliability polynomials and graph connectivity in reliable network synthesis
From MaRDI portal
Publication:3478240
DOI10.1002/jgt.3190100311zbMath0699.90041OpenAlexW2069680987MaRDI QIDQ3478240
No author found.
Publication date: 1986
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190100311
Extremal problems in graph theory (05C35) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items
Super edge-connectivity and zeroth-order general Randić index for \(-1 \leq \alpha < 0\) ⋮ On reliable graphs with static routing plans ⋮ Super connectivity of Kronecker product of complete bipartite graphs and complete graphs ⋮ On the number of spanning trees of multi-star related graphs ⋮ Sufficient conditions for \(k\)-restricted edge connected graphs ⋮ Counting spanning trees of a type of generalized Farey graphs ⋮ Optimally Reliable Graphs for Both Vertex and Edge Failures ⋮ Complexity of graphs generated by wheel graph and their asymptotic limits ⋮ A simple proof of the Gross‐Saccoman multigraph conjecture ⋮ Exact reliability optimization for series‐parallel graphs using convex envelopes ⋮ Uniformly optimally reliable graphs: A survey ⋮ Network reliability: Heading out on the highway ⋮ The <scp>Gross–Saccoman</scp> conjecture is true ⋮ The number and degree distribution of spanning trees in the Tower of Hanoi graph ⋮ Super edge-connectivity and zeroth-order Randić index ⋮ More reliable graphs are not always stronger ⋮ Enumeration of spanning trees in the sequence of Dürer graphs ⋮ Counting spanning trees of \((1, N\))-periodic graphs ⋮ On the connectivity of \(p\)-diamond-free vertex transitive graphs ⋮ Number of minimum vertex cuts in transitive graphs ⋮ On the existence of super edge-connected graphs with prescribed degrees ⋮ Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected ⋮ Superconnected and hyperconnected small degree transitive graphs ⋮ Super-connected and hyper-connected jump graphs ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ Optimally reliable networks ⋮ Invulnerability of planar two-tree networks ⋮ Nonexistence of uniformly most reliable two-terminal graphs ⋮ Restricted connectivity for some interconnection networks ⋮ Super-connected edge transitive graphs ⋮ Inverse degree and super edge-connectivity ⋮ The optimal unicyclic graphs for pair-connected reliability ⋮ The existence and upper bound for two types of restricted connectivity ⋮ Semi-hyper-connected edge transitive graphs ⋮ Enumeration of spanning trees in planar unclustered networks ⋮ Super-edge-connectivity and zeroth-order Randić index ⋮ Semi-hyper-connected vertex transitive graphs ⋮ Maximizing the number of spanning trees in \(K_n\)-complements of asteroidal graphs ⋮ Topological properties of a 3-regular small world network ⋮ Classes of uniformly most reliable graphs for all-terminal reliability ⋮ Counting spanning trees in self-similar networks by evaluating determinants ⋮ The complexity of some classes of pyramid graphs created from a gear graph ⋮ The expected number of pairs of connected nodes: Pair-connected reliability ⋮ Tree-core and tree-coritivity of graphs ⋮ On Uniformly Optimal Networks: A Reversal of Fortune?
Cites Work
