摘要
循环双三角是一个有向图,它包含两个3结构周期.研究了逆M矩阵的图在该有向图中的完备问题.对每个周期所包含的所有指定的顶点以及所包含的未指定的顶点都进行了探讨;同时给出了完备定律和运算方法.
Cylic double triangle is a digraph that contains two 3-cycles in structure.In this paper,the inverse M-matrix completion problems for the graph are studied in depth.The cases that every cycle contains all specified vertices and each cycle can contain unspecified vertices are all disussed.At the same time,the completion theorems and algorithm are given.
出处
《西北师范大学学报（自然科学版）》
CAS
北大核心
2010年第3期28-30,共3页
Journal of Northwest Normal University(Natural Science)
关键词
部分逆M矩阵
完备算法
双三角循环
partial inverse M-matrix
complete algorithm
cyclic double triangle
