Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Behzad, G. Chart rand, and L. Lesniak, Graphs and Digraphs 1979, Prindle, Weber and Schmitt.
G. Chartrand, S. F. Kapoor, and D. R. Lick, n-Hamiltonian graphs, J. Combin. Theory 9 (1970), 305–312.
V. Chvà tal, Tough graphs and Hamiltonian circuits, Discrete Math. 5 (1973), 215–228.
V. Chvà tal and P. Erdös, A note on Hamiltonian circuits, Discrete Math. 2 (1972), 111–113.
M. Cozzens, D. Moazzami, and S. Stueckle, The tenacity of a graph, submitted SIAM J. Discrete Math.
M. Cozzens, D. Moazzami, and S. Stueckle, Tenacity of the Harary graph, to appear in J. Combin. Math, and Combin. Comput.
L. L. Doty, A large class of maximally tough graph, OR Spektrum 13 (1991), 147–151.
H. Enomoto, B. Jackson, P. Katerinis, and A. Saito, Toughness and the existence of K-factors, J. Graph Theory 9 (1985), 87–95.
W. D. Goddard and H. C. Swart, On the toughness of a graph, Quaestiones Math. 13 (1990), 217–232.
D. Mann and S. Stueckle, Tenacity of trees, in preparation.
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.
T. Nishizeki, 1-tough nonhamiltonian maximal planar graphs, Discrete Math. 30 (1920, 305–307
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.
Sein Win, On a Connection Between Existence of A-trees and the toughness of a Graph, Graphs and Combinatorics 5, 201–205 (1989).
D.R. Woodwall, The binding number of a graph and its Anderson number, J. Combin. Theory Ser. B 15 (1973), 225–255.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Kluwer Academic Publishers
About this chapter
Cite this chapter
Moazzami, D. (1995). The NSM of a Graph. In: Colbourn, C.J., Mahmoodian, E.S. (eds) Combinatorics Advances. Mathematics and Its Applications, vol 329. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3554-2_16
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3554-2_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3556-6
Online ISBN: 978-1-4613-3554-2
eBook Packages: Springer Book Archive