91 |
On Network ReliabilityCox, Danielle 03 June 2013 (has links)
The all terminal reliability of a graph G is the probability that at least a spanning tree
is operational, given that vertices are always operational and edges independently
operate with probability p in [0,1]. In this thesis, an investigation of all terminal
reliability is undertaken. An open problem regarding the non-existence of optimal
graphs is settled and analytic properties, such as roots, thresholds, inflection points,
fixed points and the average value of the all terminal reliability polynomial on [0,1]
are studied.
A new reliability problem, the k -clique reliability for a graph G is introduced. The
k-clique reliability is the probability that at least a clique of size k is operational, given
that vertices operate independently with probability p in [0,1] . For k-clique reliability
the existence of optimal networks, analytic properties, associated complexes and the
roots are studied. Applications to problems regarding independence polynomials are
developed as well.
|
92 |
Two applications of difference methods to chains of linear oscillatorsChristian, William Greer 05 1900 (has links)
No description available.
|
93 |
Theorems on the realizability of physical systems having Sturm-Liouville secular polynomialsCook, Frederick Lee 08 1900 (has links)
No description available.
|
94 |
Quantization error problems for classes of trigonometric polynomialsLaDue, Mark D. 05 1900 (has links)
No description available.
|
95 |
Solutions of some countable systems of ordinary differential equationsLaw, Alan Greenwell 05 1900 (has links)
No description available.
|
96 |
Solution of some initial-value problems for the semi-infinite uniform linear chain with finitely many defectsMcKibben, William Pullin 05 1900 (has links)
No description available.
|
97 |
Polynomial solutions of problems in bending of flat platesSayer, Robert Benedict 08 1900 (has links)
No description available.
|
98 |
A study on a theorem of HamelShiau, Jye-fu 05 1900 (has links)
No description available.
|
99 |
On Ilieff's conjecture and related problemsGacs, Frank. January 1970 (has links)
No description available.
|
100 |
The characteristic polynomial of a graph /Clarke, Frank H. January 1970 (has links)
No description available.
|
Page generated in 0.0182 seconds