有向三角形树的匹配数.pdfVIP

Computer Science and Application 计算机科学与应用, 2016, 6(5), 292-302 Published Online May 2016 in Hans. /journal/csa /10.12677/csa.2016.65036 On the Matching Number of Directed Triangle Trees Mengying Li, Haixing Zhao Computer Department, QingHai Normal University, Xining Qinghai th th th Received: May 4 , 2016; accepted: May 27 , 2016; published: May 30 , 2016 Copyright © 2016 by authors and Hans Publishers Inc. This work is licensed under the Creative Commons Attribution International License (CC BY). /licenses/by/4.0/ Abstract A matching of a directed graph G is a set of some directed edges without common starting-node and end-node. K-matching of a digraph G is the matching with the k (k = 1, 2,…, n) edges; k-matching number of a graph G is the number of distinct matchings containing k (k = 1, 2,…, n) edges. The matching of a graph G refers to the number of all k-matchings. Liu and Barabasi put forward: the number of controllable nodes in directed networks is equal to the number of nodes of directed networks minus the number of edges of the maximum matching. It illustrates that the matching number and controllability of directed networks have a close connection. Thus, the re- search of the number of all matchings of directed networks is of applied significance. This article mainly studies the counting problems and the extremal problems on the number of matchings in a class of directed triangle trees. We investigate the calculation method and the expression of the matching number in a class of directed triangle trees with n triangles and determine the bounds for the matching number in directed triangle trees with n triangles an