|
|||||
|
|
A note on balance vertices in trees |
|
| Authors: | Erfang Shan and Liying Kang |
| Institution: | Department of Mathematics, Shanghai University, Shanghai 200436, China |
| Abstract: | The notion of balanced bipartitions of the vertices in a tree T was introduced and studied by Reid (Networks 34 (1999) 264). Reid proved that the set of balance vertices of a tree T consists of a single vertex or two adjacent vertices. In this note, we give a simple proof of that result. |
| Keywords: | Author Keywords: Minus domination Domination k-partite graphs |
| 本文献已被 ScienceDirect 等数据库收录！ | |