000			01582nam a22002177a 4500
003			OSt
005			20240925110135.0
008			200316b ||||| |||| 00| 0 eng d
020			_a9789380250694
040			_cEducational Supplies _aICTS-TIFR
050			_aQA166.BAP
100			_aR.B. Bapat
245			_aGraphs and matrices
250			_a2nd ed.
260			_aNew Delhi: _bHindustan Book Agency, _c[c2018]
300			_a187 p
490			_aTexts and Readings in Mathematics _vVol. 58
505			_a1 Preliminaries 2 Incidence Matrix 3 Adjacency Matrix 4 Laplacian Matrix 5 Cycles and Cuts 6 Regular Graphs 7 Line Graph of a Tree 8 Algebraic Connectivity 9 Distance Matrix of a Tree 10 Resistance Distance 11 Laplacian Eigenvalues of Threshold Graphs 12 Positive Definite Completion Problem 13 Matrix Games Based on Graphs
520			_aThis book illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph.
942			_2lcc _cBK
999			_c3047 _d3047