site stats

Strong matching preclusion number of graphs

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 … WebJul 25, 2024 · Let G be a graph and S\subseteq V (G), we use h (G-S) and c (G-S) to denote the number of isolated vertices and the number of components of G-S, respectively. Then …

Reliability of k -ary （ n-m ）-cube subnetworks under probabilistic …

WebThe strong matching preclusion number of a graph is the minimum number of edges and/or vertices whose deletion results in the remaining graph that has neither perfect matchings nor almost perfect matchings. In [14], Wang et al. proved that C k ⋯ C k is super strongly matched, where k (≥ 3) is odd. 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 … christopherlines70 gmail.com https://salermoinsuranceagency.com

The Matching Preclusion of Enhanced Hypercubes - OUP Academic

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 … WebOct 18, 2024 · The fractional strong matching preclusion number of G is the minimum number of vertices and edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the fractional matching preclusion number and the fractional strong matching preclusion number for pancake graphs and burnt pancake … WebKey words: multiprocessor system, interconnection network, k-ary n-cube, subnetwork reliability, probabilistic failure 摘要： k元n方体具有许多优良特性，已成为多处理器系统最常用的互连网络拓扑结构之一。当系统互连网络中发生故障时，系统子网络的保持能力对系统实际应用至关重要。为了精确度量k元n方体中任意规模子 ... christopher lin fidelity

Fractional matching preclusion for butterfly derived networks

Category:Strong matching preclusion for n-dimensional torus networks

Tags:Strong matching preclusion number of graphs

Strong matching preclusion number of graphs

Strong matching preclusion number of graphs - ScienceDirect

WebApr 20, 2024 · The 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 … 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?

http://www.joca.cn/EN/10.11772/j.issn.1001-9081.2024030414 Web早上，熊宝宝一起床就闻到了香喷喷的气味。“好香啊!妈妈做了什么早餐呢？”说着，熊宝宝飞快地跑下了楼。

WebThe matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu [18] recently introduced the concept of fractional matching preclusion number. 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.

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 … 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 ...

WebMar 1, 2024 · The (strong) integer k -matching preclusion number of G, denoted by m p k ( G) ( s m p k ( G) ), is the minimum number of edges (vertices and edges) whose deletion results in a graph with neither perfect integer k -matching nor almost perfect integer k …

WebJan 3, 2024 · The strong matching preclusion number (or simply, SMP number) smp (G) of a graph G is the minimum number of vertices and/or edges whose deletion results in a graph that has neither... getting your a1c downWebFeb 1, 2024 · The matching preclusion number of a graph G, denoted by mp (G), is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect... getting you home youtubeWebJan 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 … getting your agi from an irs transcriptWebJan 3, 2024 · The strong matching preclusion number (or simply, SMP number) smp (G) of a graph G is the minimum number of vertices and/or edges whose deletion results in a … christopher link jonesWebThe strong matching preclusion is a measure for the robustness of interconnection networks in the presence of node and/or link failures. However, in the case of random link and/or node failures, it is unlikely to find all the faults incident and/or adjacent to … christopher link psychotherapieWebThe Fractional Strong Matching Preclusion Number (FSMP number) of G is the minimum number of vertices and/or edges whose deletion leaves the resulting graph without a fractional perfect matching. In this paper, we obtain the FMP number and the FSMP number for ( n , k )-star graphs. christopher link mdWebAug 9, 2024 · The conditional fractional strong matching preclusion number of a graph G is the minimum size of F such that . F ⊂ V (G) ∪ E (G) and G−F has neither a fractional perfect matching nor an isolated vertex. In this paper, we obtain the conditional fractional strong matching preclusion number for burnt pancake graphs and a subset of the class ... christopher linko san francisco