Characterizations of Non-Singular Cycles, Path and Trees

被引：0

作者：

Sookyang, S. ^{[1
]}

Arworn, S. ^{[1
]}

Wojtylak, P. ^{[2
]}

机构：

[1] Chiang Mai Univ, Fac Sci, Dept Math, Chiang Mai 50200, Thailand

[2] Silesian Univ, Inst Math, PL-40007 Katowice, Poland

来源：

THAI JOURNAL OF MATHEMATICS | 2008年 / 6卷 / 02期

关键词：

Simple graph; adjacency matrix; non-singular graph; cycle; tree;

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A simple graph is said to be non-singular if its adjacency matrix is non-singular. In this paper, we find the characterization of non-singular cycles and trees. Main Theorems: 1. A cycle C-n of n points is non-singular iff n is not divided by 4. 2. A path P-n is non-singular if and only if n is even. 3. A tree T is non-singular iff T has an even number of points and contains a sesquivalent spanning subgraph.

引用

页码：331 / 336

页数：6