Abstract
In this paper, a recurrence formula for computing the characteristic polynomial of a graph due to A.J. Schwenk is generalised to arbitrary networks, and some useful reductions of this formula are cited.
The work was done when the author was at Mehta Research Institute, Allahabad.
Research supported by the Council of Scientific and Industrial Research, New Delhi, and partially by Government of India Research Project No. HCS/DST/409/76.
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
B.D. Acharya, A graph theoretical expression for the characteristic polynomial of a matrix, Proc. Nat. Acad. Sci. (India), 49 (Sec. A) (1979).
W.K. Chen, Applied Graph Theory: Graphs and Electrical Networks, North-Holland, Amsterdam, 1975.
M.K. Gill and B.D. Acharya, A recurrence formula for computing the characteristic polynomial of a sigraph, J. Comb. Infor. Sys. Sci., 5(1) (1980), 1–5.
F. Harary, A graph theoretical method for complete reduction of a matrix with a view toward finding its eigenvalues, J. Math. Physics, 38(1959), 104–111.
F. Harary, The determinant of the adjacency matrix of a graph, SIAM Rev., 4(3) (1962), 202–210.
F. Harary, R. Z. Norman, and D. Cartwright, Structural models: An introduction to the theory of directed graphs, Wiley, 1965.
F. Harary, Graph Theory, Addison-Wesley, Reading, Mass., 1972.
D. König, Theorie der endlichen und unendlichen graphen, Leipzig, 1936 (Reprinted New York, 1950).
M.J. Rigby, R.B. Mallion, and A.C. Day, Comment on a graph theoretical description of heteroconjugated molecules, Chemical Physics Letters, 51(1) (1977), 178–182.
A.J. Schwenk, Computing the characteristic polynomial of a graph, Springer-Verlag Lecture Notes in Mathematics, Vol. 406 (1974), 153–172.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this paper
Cite this paper
Gill, M.K. (1981). A graph theoretical recurrence formula for computing the characteristic polynomial of a matrix. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092268
Download citation
DOI: https://doi.org/10.1007/BFb0092268
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11151-1
Online ISBN: 978-3-540-47037-3
eBook Packages: Springer Book Archive