摘要
图的最优填充在稀疏矩阵计算中有重要的作用。利用图的分解定理和约化准则给出了扇形格子图Fm,n(m=1,2;n=1,2,3)和球面经纬图Cm,n(m=1;n=3,4)及(m,n)-构形等的填充数表达式,从而为确定这些图类的填充奠定了基础,并提出进一步研究的建议。
The optimal fill-in of graph plays an important role in the sparse matrix computations.The minimum fill-in of some special graphs,such as grid graph on a fan,meridian and latitude lines on a sphere and ( m,n )-configuration is studied. It is theoretical basis of further research.
出处
《河南科技大学学报（自然科学版）》
CAS
2004年第1期93-96,共4页
Journal of Henan University of Science And Technology:Natural Science
