摘要
借助拟阵为理论工具，提出了用特殊树法确定可图的ＲＣＮｕｌｏｒ网络的复杂度，进一步阐明了网络的拓扑结构与网络复杂度的关系。
With the matriod as the theoretical instrument, the special tree approach which can determine the complexity of graphic RC Nullor networks is presented. The relation between topological construction and complexity is clarified even further.
