Strong matching preclusion number of graphs
WebThe strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost … WebJul 27, 2024 · The fractional matching preclusion number of a graph G, denoted by fmp(G), is the minimum number of edges whose deletion results in a graph with no fractional perfect matchings.Let \(G_{k,n}\) be the complete n-balanced k-partite graph, whose vertex set can be partitioned into k parts, each has n vertices and whose edge set contains all edges …
Strong matching preclusion number of graphs
Did you know?
WebOct 14, 2016 · According to the definition of mp ( G ), for a graph G with the even number of vertices, we have that mp (G)\le \delta (G). A set F of edges and vertices of G is a strong MP set (SMP set for short) if G-F has neither perfect matchings nor almost-perfect matchings. The SMP number of G , denoted by smp ( G ), is the minimum size of SMP sets of G. WebThis is an extension of the matching preclusion problem and has recently been introduced by Park and Ihm. 15 In this paper, we examine properties of strong matching preclusion for alternating group graphs, by finding their strong matching preclusion numbers and categorizing all optimal solutions.
WebKey words: multiprocessor system, interconnection network, k-ary n-cube, subnetwork reliability, probabilistic failure 摘要： k元n方体具有许多优良特性，已成为多处理器系统最常用的互连网络拓扑结构之一。当系统互连网络中发生故障时，系统子网络的保持能力对系统实际应用至关重要。为了精确度量k元n方体中任意规模子 ... Websystems. In this paper, we show that the strong matching preclusion number of an n-dimensional bubble-sort star graph BSn is 2 for n 3 and each op-timal strong matching preclusion set of BSn is a set of two vertices from the same bipartition set. Moreover, we show that the matching preclusion number
Webtimal strong matching preclusion set of BSn is a set of two vertices from the same bipartition set. Moreover, we show that the matching preclusion number of BSn is 2n 3 for … WebThe strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. Park ...
WebJan 8, 2024 · The strong matching preclusion number of a graph, introduced by Park and Ihm in 2011, is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, the fractional strong matching preclusion number of a graph is the minimum number of …
http://www.joca.cn/EN/10.11772/j.issn.1001-9081.2024030414 prime truck trackingWebThe bubble-sort star graph is one of the validly discussed interconnection networks related to the distributed systems. In this paper, we show that the strong matching preclusion … prime trust 3ds not workingWebAug 25, 2024 · Matching preclusion also has connections to a number of theoretical topics, including conditional connectivity and extremal graph theory, and further studied in [4-6,9] with special attention given to interconnection networks. In [13], the concept of strong matching preclusion was introduced. prime truck wash patterson caWebThis is an extension of the matching preclusion problem and has recently been introduced by Park and Ihm. 15 In this paper, we examine properties of strong matching preclusion … play sift heads games onlineWebThe strong matching preclusion number (or simply, SMP number) is a generalization of the matching preclusion number; the SMP number of a graph G, smp(G) is the minimum … play sigcorp minisode1WebJan 8, 2024 · Abstract: The strong matching preclusion number of a graph, introduced by Park and Ihm in 2011, is the minimum number of vertices and edges whose deletion … play sigcorp-minisodeWebThe strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost … play sigcorp