Terry A. McKeeElsevier B.V.Discrete MathematicsMcKee, T. A. 2003. "Subgraph Trees in Graph Theory." Discrete Mathematics 270: 3-12.T. A. McKee, Subgraph trees in graph theory, Discrete Math., 270 (2003) 3-12.T. McKee. Subgraph trees in graph theory. Discrete Applied Mathematics, 270...
森林(forest)是一个无环图(acyclic graph) 树(tree)是一个连通无环图(connected acyclic graph) 叶(leaf)是一个图中度为 1 的节点 例子如下 我们发现,一个有两个或者多个节点的树通常都会有一个叶,针对这个,我们给出一个定理 定理2.1 leaf lemma 叶引理 任意一个有两个或多个节点的树都有至少两个度为 ...
They were very interested in the trees. They were all ACMers, so after careful observation, they found out that these two trees could be considered as two "trees" in graph theory. These two trees sharedNNvertices which were labeled11toNN, and they all had exactlyNNvertices. Vertices11was ...
An introduction to chordal graphs and clique trees, in Graph theory and sparse matrix computation CiteSeerX - Scientific documents that cite the following paper: An introduction to chordal graphs and clique trees, in Graph theory and sparse matrix compu... BJ Blair,B Peyton - 1–29, Ima 被引...
The problem of efficient generation of trees of a graph has been treated rather extensively in the literature. In this paper it is shown that many of the existing techniques in the literature, seemingly so different in their appearance, are actually the variants of the Wang algebra formulation....
本期专栏为“谱图理论”系列的第13期,将介绍耶鲁大学教授、两届哥德尔奖得主Daniel A. Spielman所著图书《Spectral and Algebraic Graph Theory》(电子版链接)第十三章Ch13: Random Spanning Trees中的内容。 本期作者 | 何明国,中国人民大学高瓴人工智能学院 ...
Learn about graph theory and how trees are used to solve complex problems. Discover the beauty and simplicity of tree structures. Start exploring now!
期末考试仅限于期中考试以后的内容:Chapter 7 Trees; Chapter 8 Topics in graph theory. 考试题型:计算题;简答题;证明题;构造图形(构造满足一定条件的图,如:6个顶点,11条边且无Hamiltonian circuit)。题目共计6题,无选择题和填空题。 考试难度:基本与期中考试相同,有一定数量的题直接来自于习题,最后一题较难...
In this paper, we study the k-tree partition problem which is apartition of the set of edges of a graph into k edge-disjoint trees.This problem occurs at several places with applications e.g. in networkreliability and graph theory. In graph drawing there is the stillunbeaten (n-2) x ...
- 《Discussiones Mathematicae Graph Theory》 被引量: 37发表: 2009年 Counting Structures in Grid-Graphs, Cylinders and Tori using Transfer Matrices: Survey and New Results There is a very large literature devoted to counting structures, e.g., spanning trees, Hamiltonian cycles, independent sets, ...