On the normal disconnection of a tree
A. Kośliński (1987)
Applicationes Mathematicae
Similarity:
Displaying similar documents to “The forcibly-tree and forcibly-unicyclic degree sequences.”
On the normal disconnection of a tree
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...
Independence number and degree bounded spanning tree.
Rahman, Mohammad Sohel, Kaykobad, Mohammad (2004)
Applied Mathematics E-Notes [electronic only]
Similarity:
On reconstructing of infinite forests
Jaroslav Nešetřil (1972)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Reduced powers of -trees
Keith Devlin (1983)
Fundamenta Mathematicae
Similarity:
An axiomatic theory of information trees
Keh-Hsun Chen, Zbigniew W. Ras (1988)
Banach Center Publications
Similarity:
Sur le problème de Catalan.
A. Rotkiewicz (1960)
Elemente der Mathematik
Similarity:
Completely Independent Spanning Trees in (Partial) k-Trees
Masayoshi Matsushita, Yota Otachi, Toru Araki (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that [k/2] ≤ cist(G) ≤ k − 1 for any k-tree G. Then we show that for any p ∈ {[k/2], . . . , k − 1}, there exist infinitely many k-trees G such...