The forcibly-tree and forcibly-unicyclic degree sequences.

F. Harary; G. Exoo

Displaying similar documents to “The forcibly-tree and forcibly-unicyclic degree sequences.”

On the normal disconnection of a tree

A. Kośliński (1987)

Applicationes Mathematicae

Similarity:

Deducing Properties of Trees From Their Matula Numbers

Ivan Gutman, Yeong-Nan Yeh (1993)

Publications de l'Institut Mathématique

Similarity:

On the rules for the elimination of the non-canonical Morgan trees

Damir Vukičević (2009)

Kragujevac Journal of Mathematics

Similarity:

On a Spanning k-Tree in which Specified Vertices Have Degree Less Than k

Hajime Matsumura (2015)

Discussiones Mathematicae Graph Theory

Similarity:

A k-tree is a tree with maximum degree at most k. In this paper, we give a degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than k. We denote by σk(G) the minimum value of the degree sum of k independent vertices in a graph G. Let k ≥ 3 and s ≥ 0 be integers, and suppose G is a connected graph and σk(G) ≥ |V (G)|+s−1. Then for any s specified vertices, G contains a spanning k-tree in which every specified vertex has degree less than...