A typical vertex of a tree

Ping Hong Wei, Chih-Wen Weng*

*此作品的通信作者

研究成果: Article同行評審

3 引文 斯高帕斯(Scopus)

摘要

Let T denote a tree with at least three vertices. Observe that T contains a vertex which has at least two neighbors of degree one or two. A class of algorithms on trees related to the observation are discussed and characterized. One of the example is an algorithm to compute the minimum rank m(T) of the symmetric matrices with prescribed graph T, which is easier to process than the algorithm previous found by Nylen [Linear Algebra Appl. 248 (1996) 303-316]. Two interpretations of the number m( T) in terms of some combinatorial properties on trees are given.

原文English
頁(從 - 到)337-345
頁數9
期刊Discrete Mathematics
226
發行號1-3
DOIs
出版狀態Published - 6 1月 2001

指紋

深入研究「A typical vertex of a tree」主題。共同形成了獨特的指紋。

引用此