Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Harrington, J. ; Wong, T. (Ed.)We introduce a new measure of network reliability related to the order of the largest component. This new connectivity measure considers a network to be operational if there is a component or order at least some fixed proportion, r, of the original order. Thus, the network is in a failure state if all components are sufficiently small. In this paper, we consider the parameters with vertex deletions as well as edge deletions for particular graph classes. We also find the minimum values of the parameter for graphs with a fixed size and order. We end with a discussion and some conjectures for the maximum value of the parameter for graphs with a fixed size and order.more » « less
-
In this paper, we investigate the existence of Sierpi´nski numbers and Riesel numbers as binomial coefficients. We show that for any odd positive integer r, there exist infinitely many Sierpi´nski numbers and Riesel numbers of the form kCr. Let S(x) be the number of positive integers r satisfying 1 ≤ r ≤ x for which kCr is a Sierpi´nski number for infinitely many k. We further show that the value S(x)/x gets arbitrarily close to 1 as x tends to infinity. Generalizations to base a-Sierpi´nski numbers and base a-Riesel numbers are also considered. In particular, we prove that there exist infinitely many positive integers r such that kCr is simultaneously a base a-Sierpi´nski and base a-Riesel number for infinitely many k.more » « less
-
Node-Kayles is an impartial game played on a simple graph. The Sprague-Grundy theorem states that every impartial game is associated with a nonnegative integer value called a Nimber. This paper studies the Nimber sequences of various families of graphs, including 3-paths, lattice graphs, prism graphs, chained cliques, linked cliques, linked cycles, linked diamonds, hypercubes, and generalized Petersen graphs. For most of these families, we determine an explicit formula or a recursion on their Nimber sequences.more » « less
Full Text Available