A Combinatorial Approach to Matrix Theory and Its Applications

A Combinatorial Approach to Matrix Theory and Its Applications

Volumn , Issue , 2008, Pages 1-267

  Brualdi, Richard A ^a   Cvetković, Dragosš ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b UNIVERSITY OF BELGRADE   (Serbia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85055803304     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (83)

1. A. C. Aitken, Determinants and Matrices, Edinburgh, United Kingdom: Oliver and Boyd, 1939.
2. A. T. Balaban, ed., Chemical Application of Graph Theory, London: Academic Press, 1976.
3. R. B. Bapat, T. E. S. Raghavan, Nonnegative Matrices and Applications, Cambridge: Cambridge University Press, 1997.
4. V.A. Barker, editor, Sparse matrix techniques, Advanced course held at the Technical University of Denmark, Copenhagen, August 9–12, 1976, Lecture Notes Math. No. 572, Berlin-Heidelberg-New York: Springer-Verlag, 1977.
5. S. Barnett, London-New York-Toronto, Ontario: Matrices in control theory, 1971.
6. R. A. Brualdi, The Jordan canonical form: an old proof, Amer. Math. Monthly, 94(1987), No. 3, 257–267.
7. R. A. Brualdi, H. J. Ryser, Combinatorial Matrix Theory, Cambridge: Cambridge University Press, 1991; reprinted 1992.
8. R. A. Brualdi, Introductory Combinatorics, fourth edition, Upper Saddle River NJ: Pearson Prentice-Hall, 2004.
9. R. A. Brualdi, Combinatorial Matrix Classes, Cambridge: Cambridge University Press, 2006.
10. R. A. Brualdi, B. L. Shader, Matrices of Sign-Solvable Linear Systems, Cambridge: Cambridge University Press, 1995.
11. J. R. Bunch and D. J. Rose, eds., Sparse matrix computations, New York-San Francisco-London: Academic Press, 1976.
12. A. Cayley, A theorem on trees, Quart. J. Math. 23(1889), 376–378.
13. C. L. Coates, Flow graph solutions of linear algebraic equations, IRE Trans. Circuit Theory, CT-6(1959), 170–187.
14. S. P. Chan, Introductory Topological Analysis of Electrical Networks, New York: Holt, Rinehart and Winston, 1969.
15. S. P. Chan, B. H. Bapna, A modification of the Coates gain formula for the analysis of linear systems, Int. J. Control, 5 (1967), No. 5, 483–495.
16. S. P. Chan, H. N. Mai, A flow-graph method for the analysis of linear systems, IEEE Trans. Circuit Theory, CT-14 (1967), No. 3, 350–354.
17. W. K. Chen, Applied Graph Theory, Amsterdam-London: North-Holland, 1971.
18. L. Collatz, Eigenwertaufgaben mit technischen Anwendungen, Leipzig: Akademische Verlagsgesellschaft. Geest & Por-tig, 1963.
19. L. Collatz, U. Sinogowitz, Spektren Endlicher Grafen, Abh. Math. Sem. Univ. Hamburg, 21(1957), 63–77.
20. C. D. H. Cooper, On the maximum eigenvalue of a reducible non-negative real matrix, Math. Z. 131(1973), 213–217.
21. C. A. Coulson, B. O’Leary, R. B. Mallion, Hückel Theory for Organic Chemists, London: Academic Press, 1978.
22. D. M. Cvetković, The determinant concept defined by means of graph theory, Mat. Vesnik 12(27)(1975), 333–336. Dutch version: Definitie en berekaning van determinanten met be-hulp van grafen, Nieuw Tijdsch. v. Wisk. 63(1976), No. 4, 209–215.
23. D. Cvetković, Combinatorial Matrix Theory, with Applications to Electrical Engineering, Chemistry and Physics, (in Serbian), Beograd: Naučna knjiga, 1980; 2nd ed. 1987.
24. D. Cvetković, M. Doob, H. Sachs, Spectra of Graphs—Theory and Application, Deutscher Verlag der Wissenschaften–Academic Press, Berlin–New York 1980; 2nd ed. 1982; Russian translation: Naukova Dumka, Kiev, 1984; 3rd ed. Heidelberg-Leipzig: Johann Ambrosius Barth, 1995.
25. D. Cvetković, I. Gutman, The algebraic multiplicity of the number zero in the spectrum of a bipartite graph, Mat. Vesnik, 9(24)(1972), 141–150.
26. C. A. Desoer, The optimum formula for the gain of a flow graph or a simple derivation of Coates’ formula, Proc. IRE 48(1960), 883–889.
27. J. R. Dias, Molecular Orbital Calculations Usig Chemical Graph Theory, Berlin-Heidelberg-New York: Springer-Verlag, 1983.
28. R. C. Dorf, The Electrical Engineering Handbook, Boca Raton, FL: CRC Press, 1999.
29. I. S. Duff, A. M. Erisman, J.K. Reid, Direct Methods for Sparse Matrices, 2nd edition, New York: Oxford Science Publishers, The Clarendon Press, Oxford University Press, 1989.
30. A. L. Dulmage, N. S. Mendelsohn, in Graphs and matrices, Graph Theory and Theoretical Physics (Editor: F. Harary), London-New York Academic Press, 1967, 167–227.
31. S. Even, Graph Algorithms, London: Pitman Publishing Limited, 1979.
32. M. Fiedler, Some applications of the theory of graphs in matrix theory and geometry, Theory of Graphs and its Applications, Proc. Symp. held in Smolenice in June 1963, Praque 1964, 37–41.
33. M. Fiedler, Inversion of bigraphs and connections with the Gauss elimination, Graphs, Hypergraphs and Block Systems, Proc. Symp. on Comb. Analysis, held in Zielona Góra, September 1976, Zielona Góra, 1976, 57–68.
34. G. F. Frobenius, Über zerlegbare Determinanten, Sitzungsber. Preuss. Akad. Wiss., Berlin, 1917, 274–277.
35. F. R. Gantmacher, Theory of Matrices, I, II, New York: Chelsea, 1960, (Translated from Russian).
36. A. Graovac, I. Gutman, N. Trinajstić, Topological Approach to the Chemistry of Conjugated Molecules, Berlin-Heidelberg-New York: Springer-Verlag, 1977.
37. J. V. Greenman, Graphs and determinants, Math. Gazette, 60(1976), 241–246.
38. J. V. Greenman, Graphs and Markov Chains, Math. Gazette 60(1976), 49–54.
39. J. L. Gross, J. Yellen, Graph Theory and its Applications, 2nd ed., Boca Raton, FL: CRC Press, 2005.
40. I. Gutman, Chemical graph theory—The mathematical connection. In eds. S. R. Sabin, E. J. Brändas Advances in Quantum Chemistry 51, Amsterdam: Elsevier, 2006, 125– 138.
41. I. Gutman, The acyclic polynomial of graph, Publ. Inst. Math. (Beograd), 22(1977), 63–69.
42. I. Gutman, O. E. Polansky, Mathematical concepts in organic chemistry, Berlin-Heidelberg-New York: Springer-Verlag, 1986.
43. I. Gutman, N. Trinajstić, Graph theory and molecular orbitals, Topics Curr. Chem., 42(1973), 49–93.
44. F. Harary, A graph theoretic method for the complete reduction of a matrix with a view toward finding its eigenvalues, J. Math. Phys., 38(1959), 104–111.
45. F. Harary, The determinant of the adjacency matrix of a graph, SIAM Rev., 4(1962), 202-210.
46. L. Hogben, editor, Handbook of Linear Algebra, Boca Raton, FL: CRC Press, 2007.
47. R. A. Horn and C. R. Johnson, Cambridge: Matrix Analysis, Cambridge University Press, 1985.
48. R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge: Cambridge University Press, 1991.
49. W. Jackson, A characterization of the reducibility of nonnegative matrices, Proc. 8th South-Eastern Conf. on Combinatorics, Graph Theory and Computing, Winnipeg, 1977, 381–384.
50. D. Janežič, A. Miličević, S. Nikolić, N. Trinajstić, Graph Theoretical Matrices in Chemistry, Univ. Kragujevac, Kragujevac, 2007.
51. M. Kac, Can one hear a shape of a drum?, Amer. Math. Monthly, 73(1966), April, Part II, 1–23.
52. P. W. Kasteleyn, Graph theory and crystal physics. In Graph Theory and Theoretical Physics, ed. F. Harary, London-New York, 1967, 43–110.
53. G. Kirchhoff, Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der Verteilung galvanis-cher Ströme geführt wird, Ann. Phys. Chem., 72(1847), 497– 508.
54. W. Kocay, D.L.Kreher, Graphs, Algorithms, and Optimization, Boca Raton, FL: CRC Press, 2004
55. D. König, Über Graphen und ihre Anwendungen auf Determinanten-theorie und Mengenlehre, Math. Ann., 77(1916), 453–465.
56. D. König, Theorie der Endlichen und Unendlichen Graphen, Leipzig: Akad. Verlag M.B.H., 1936. New York: Chelsea, 1950.
57. P.-M. Lin, Symbolic Network Analysis, Amsterdam: Elsevier, 1991.
58. E. K. Lloyd, Matrices, graphs and adjoints, Math. Gazette, 61(1977), 201–204.
59. S. J. Mason, Feedback theory, some properties of signal flow graphs, Proc. IRE, 41(1953), 9, 1144–1156.
60. S. J. Mason, Feedback theory, further properties of signal flow graphs, Proc. IRE, 44(1956), 7, 920–926.
61. M. Milić, Flow-graph evaluation of the characteristic polynomial of a matrix, IEEE Trans. Circuit Theory, CT-11(1964), 423–424.
62. H. Minc, Nonnegative Matrices, New York: Wiley, 1988.
63. E. W. Montroll, Lattice statistics, Applied Combinatorial Mathematics, ed. E. F. Beckenbach, New York–London– Sidney: John Wiley and Sons, 1964, 96–143.
64. T. Muir, The Theory of Determinants in the Historical Order of Development, I, New York: Dover, 1960.
65. M. Parodi, La localisation des valeurs caractéristiques des matrices et ces applications, Paris: Gauthier-Villars, 1959.
66. J. K. Percus, Combinational Methods, Berlin-Heidelberg-New York: Springer-Verlag, 1969.
67. M. Perić, I. Gutman, J. Radić-Perić, The Hückel total π-electron energy puzzle, J. Serb. Chem. Soc., 71 (2006) 771– 783.
68. K.H. Rosen, editor, Handbook of Discrete and Combinatorial Mathematics, Boca Raton, FL: CRC Press, 2000.
69. D. E. Rutherford, Some continuant determinants arising in physics and chemistry, Proc. Roy. Soc. Edinburgh Sec. A, 62 (1947), 229–236.
70. D. E. Rutherford, The Cayley-Hamilton theorem for semir-ings, Proc. Roy. Soc. Edinburgh Sec. A, 66 (1964), 211–215.
71. H. Sachs, Beziehungen zwischen den in einem Graphen en-thaltenen Kreisen und seinem charakteristishen Polynom, Publ. Math. (Debrecen) 11(1963), 119–134.
72. H. Schneider, The concept of irreducibility and full indecom-posability of a matrix in the works of Frobenius, König and Markov, Linear Algebra and Appl., 18 (1977), 139–162.
73. C. E. Shannon, The theory and design of linear differential equations machines, OSDR Rep. 411, U.S. National Defense Committee, 1942.
74. V. Strassen, Gaussian elimination is not optimal, Numer. Math., 13(1969), 4, 354–356.
75. H. Straubing, A combinatorial proof of the Cayley–Hamilton theorem, Discrete Math., 43(1983), 273–279.
76. R. P. Tewarson, Sparse matrices, New York-London: Academic Press, 1973.
77. N. Trinajstić, Chemical Graph Theory, Boca Raton, FL: CRC Press, 1983; 2nd revised ed., 1993.
78. R. S. Varga, Ger˘sgorin and His Circles, Berlin-Heidelberg-New York: Springer-Verlag, 2004.
79. D. B. West, Introduction to Graph Theory, 2nd edition, Upper Saddle River, NJ: Prentice-Hall, 2001.
80. D. Younger, A simple derivation of Mason‘s gain formula, Proc. IEEE, 51(1963), 1043–1044.
81. D. Zeilberger, A combinatorial approach to matrix algebra, Discrete Math., 56(1985), 61–72.
82. F. Zhang, Linear Algebra: Challenging Problems for Students, Baltimore: Johns Hopkins University Press, 1996.
83. R. Zurmühl, Matrizen und ihre technischen Anwendungen, Berlin-Göttingen-Heidelberg: Springer-Verlag, 1961.