This work was supported (in part) by the office of Naval Research under Contract NONR 3775(00). It contains portions of material presented in a lecture under this title given at the New York Graph Theory Conference, sponsored by St. John’s University, in June, 1970.
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
A. J. Hoffman, "Generalizations of Gerschgorin’s Theorem: G-Generating Families", lecture notes, University of California at Santa Barbara, August, 1969, 46 pp.
A. J. Hoffman and R. S. Varga, Patterns of Dependence in Generalizations of Gerschgorin’s Theorem, to appear in SIAM Journal of Numerical Analysis.
M. Marcus and H. Minc, "A Survey of Matrix Theory and Matrix Inequalities", Allyn and Bacon, Boston, 1964.
P. Nowosad, "On the Functional (x−1, Ax) and Some of Its Applications", An. Acad. Brasil Ci. 37 (1965), 163–165.
Editor information
Rights and permissions
Copyright information
© 1971 Springer-Verlag
About this paper
Cite this paper
Hoffman, A.J. (1971). Combinatorial aspects of Gerschgorin’s theorem. In: Capobianco, M., Frechen, J.B., Krolik, M. (eds) Recent Trends in Graph Theory. Lecture Notes in Mathematics, vol 186. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0059434
Download citation
DOI: https://doi.org/10.1007/BFb0059434
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-05386-6
Online ISBN: 978-3-540-36508-2
eBook Packages: Springer Book Archive