A typical vertex of a tree

DOI10.1016/S0012-365X(00)00135-7zbMath0964.05020OpenAlexW2115617572MaRDI QIDQ1841915

Ping-Hong Wei, Chih-Wen Weng

Publication date: 16 April 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00135-7

zbMATH Keywords

rankrecursive algorithmscomponent

Mathematics Subject Classification ID

Trees (05C05)

Related Items (3)

Computation of minimal rank and path cover number for certain graphs ⋮ Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph ⋮ The minimum rank of symmetric matrices described by a graph: a survey

This page was built for publication: A typical vertex of a tree