A term used in graph theory. A matching of a graph is any subset of its edges such that no two members of the subset are adjacent. A perfect matching is a matching in which every vertex of the graph is an end-point of some element of the matching.
科学参考收录了60776条科技类词条，基本涵盖了常见科技类参考文献及英语词汇的翻译，是科学学习和研究的有利工具。