| 有向图的特征多项式及其与图的某些整体性质的关系 |
| |
| 引用本文： | 阎世珍,陈祥.有向图的特征多项式及其与图的某些整体性质的关系[J].太原理工大学学报,1988(4). |
| |
| 作者姓名： | 阎世珍 陈祥 |
| |
| 作者单位： | 太原工业大学，山西农药厂 |
| |
| 摘 要： | 本文引入有向图的特征多项式、反图、对称闭包等概念。初步探讨它们与图的某些整体性质的关系。推导出由特征多项式的系数表示的线图(无重边图)中圈的个数,双向结点对个数,单向结点对个数及简单图中有向三角形个数的计算公式,等等。
|
| 关 键 词： | 有向图 特征多项式 圈 反图 对称闭包 双向结点对 单向结点对 |
Characteristic Polynomial of a Digraph and Relations Between the Polynomial and Some Whole Properties of the Digraph |
| |
| Yah Shizhen Chen Xiang.Characteristic Polynomial of a Digraph and Relations Between the Polynomial and Some Whole Properties of the Digraph[J].Journal of Taiyuan University of Technology,1988(4). |
| |
| Authors: | Yah Shizhen Chen Xiang |
| |
| Institution: | Yah Shizhen Chen Xiang |
| |
| Abstract: | In this paper,the concept of the characteristic polynomial,the converse graph,the symmetrical closure and others are defined.The formulae for the number of loops,edges,triangles,pairs of two-way nodes and pairs of one-way nodes are deduced by the coefficients of a characteristic polynom- ial,so on. |
| |
| Keywords: | digraph characteristic polynomial loop converse graph symmetrical closure pair of two-way nodes pair of one-way nodes |
| 本文献已被 CNKI 等数据库收录！ |
