Arbres avec un nombre maximum de sommets pendants |
| |
Authors: | C Payan M Tchuente NH Xuong |
| |
Institution: | I.M.A.G., B.P. 53X, 38041 Grenoble Cédex, France |
| |
Abstract: | This article is an attempt to study the following problem: Given a connected graph G, what is the maximum number of vertices of degree 1 of a spanning tree of G? For cubic graphs with n vertices, we prove that this number is bounded by and . |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|