A typical vertex of a tree

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...

Full description

Saved in:
Bibliographic Details
Published inDiscrete mathematics Vol. 226; no. 1; pp. 337 - 345
Main Authors Wei, Ping-Hong, Weng, Chih-Wen
Format Journal Article
LanguageEnglish
Published Elsevier B.V 2001
Subjects
Rank
Rank
05C05
Online AccessGet full text

Cover

More Information
Summary: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)d 303–316]. Two interpretations of the number m(T) in terms of some combinatorial properties on trees are given.
ISSN:0012-365X
1872-681X
DOI:10.1016/S0012-365X(00)00135-7