Triangulated graphs and the elimination process
作者： Donald J Rose
DOI: 10.1016/0022-247X(70)90282-9
关键词: Independent set 、 Chordal graph 、 System of linear equations 、 Mathematics 、 Discrete mathematics 、 Gaussian elimination 、 Process of elimination 、 Graph 、 Combinatorics 、 Strongly chordal graph 、 Positive-definite matrix
摘要: Abstract A triangulated graph is a in which for every cycle of length l > 3, there an edge joining two nonconsecutive vertices. In this paper we study graphs and show that they play important role the elimination process. The results have application numerical solution sparse positive definite systems linear equations by Gaussian elimination.
elsevier.com
sci-hub.se 参考文章(3)
G. A. Dirac, On rigid circuit graphs Abhandlungen Aus Dem Mathematischen Seminar Der Universitat Hamburg. ,vol. 25, pp. 71- 76 ,(1961) , 10.1007/BF02992776
S. Parter, The Use of Linear Graphs in Gauss Elimination SIAM Review. ,vol. 3, pp. 119- 130 ,(1961) , 10.1137/1003021
Delbert Fulkerson, Oliver Gross, Incidence matrices and interval graphs Pacific Journal of Mathematics. ,vol. 15, pp. 835- 855 ,(1965) , 10.2140/PJM.1965.15.835