The NSM of a Graph
The purpose of this paper is to introduce a new invariant for measures of stability in networks. Since many network properties are actually properties of the underlying graph, we restrict this discussion to undirected graphs. We prove a number of basic results about this new parameter, including several relating it to other parameters of a graph, operations on graph, and Hamiltonian properties.
Unable to display preview. Download preview PDF.
- M. Behzad, G. Chart rand, and L. Lesniak, Graphs and Digraphs 1979, Prindle, Weber and Schmitt.Google Scholar
- M. Cozzens, D. Moazzami, and S. Stueckle, The tenacity of a graph, submitted SIAM J. Discrete Math.Google Scholar
- M. Cozzens, D. Moazzami, and S. Stueckle, Tenacity of the Harary graph, to appear in J. Combin. Math, and Combin. Comput.Google Scholar
- D. Mann and S. Stueckle, Tenacity of trees, in preparation.Google Scholar
- J. C. Molluzzo, Toughness, Hamiltonian connectedness and n-Hamiltonicity, Annals N. Y. Acad. Sci. 319, Proceedings of Second International Conf. on Comb. Math., New York, 1979 (A. Gewirtz, et al., eds.), 402–404.Google Scholar
- R. E. Pippert, On the toughness of a graph, in Graph Theory and its Application, Lect. Notes in Math. 303, Springer, Berlin, 1972 (Y. Alavi, ed.), 225–233.Google Scholar
- D.R. Woodwall, The binding number of a graph and its Anderson number, J. Combin. Theory Ser. B 15 (1973), 225–255.Google Scholar