摘要
图的完美匹配或1-因子指覆盖了其所有顶点的独立边集.对含有完美匹配的平面二部图,其所有完美匹配通过某旋转变换形成层次组织结构,可用有向根树或半格表示.
A perfect matching or 1 factor of a graph is a set of independent edges covering all the vertices. For a plane bipartite graph G with perfect matchings, it was shown that all perfect matchings of G form a hierarchical structure through a certain rotation transformation, which can be expressed by a directed rooted tree or semilattice. And a novel directed rooted tree structure of the set of perfect matchings of G is established and can be generated by designing an algorithm.
出处
《兰州大学学报(自然科学版)》
CAS
CSCD
北大核心
1996年第3期7-11,共5页
Journal of Lanzhou University(Natural Sciences)
基金
兰州大学校内青年基金
关键词
平面图
树
有向图
二部图
完美匹配
有向根树
plane graph tree directed graph bipartite graph perfect matching directed rooted tree