Vertex-Fault Tolerant Complete Matching in Bipartite graphs: the Biregular Case

07/10/2019
by   Sylwia Cichacz, et al.
0

Given a family H of graphs and a positive integer k, a graph G is called vertex k-fault-tolerant with respect to H, denoted by k-FT(H), if G-S contains some H∈H as a subgraph, for every S⊂ V(G) with |S|≤ k. Vertex-fault-tolerance has been introduced by Hayes [A graph model for fault-tolerant computing systems, IEEE Transactions on Computers, C-25 (1976), pp. 875-884.], and has been studied in view of potential applications in the design of interconnection networks operating correctly in the presence of faults. We define the Fault-Tolerant Complete Matching (FTCM) Problem in bipartite graphs of order (n,m): to design a bipartite G=(U,V;E), with |U|=n, |V|=m, n>m>1, that has a FTCM, and the tuple (Δ_U, Δ_V), where Δ_U and Δ_V are the maximum degree in U and V, respectively, is lexicographically minimum. G has a FTCM if deleting at most n-m vertices from U creates G' that has a complete matching, i.e., a matching of size m. We show that if m(n-m+1)/n is integer, solutions of the FTCM Problem can be found among (a,b)-regular bipartite graphs of order (n,m), with a=m(n-m+1)/n, and b=n-m+1. If a=m-1 then all (a,b)-regular bipartite graphs of order (n,m) have a FTCM, and for a<m-1, it is not the case. We characterize the values of n, m, a, and b that admit an (a,b)-regular bipartite graph of order (n,m), with b=n-m+1, and give a simple construction that creates such a graph with a FTCM whenever possible. Our techniques are based on Hall's marriage theorem, elementary number theory, linear Diophantine equations, properties of integer functions and congruences, and equations involving them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/07/2019

The Fault-Tolerant Metric Dimension of Cographs

A vertex set U ⊆ V of an undirected graph G=(V,E) is a resolving set for...
research
10/19/2019

Strengthening some complexity results on toughness of graphs

Let t be a positive real number. A graph is called t-tough if the remova...
research
07/16/2020

Optimal Vertex Fault-Tolerant Spanners in Polynomial Time

Recent work has pinned down the existentially optimal size bounds for ve...
research
08/31/2023

Optimality and Constructions of Spanning Bipartite Block Designs

We consider a statistical problem to estimate variables (effects) that a...
research
09/16/2021

Vertex Fault-Tolerant Emulators

A k-spanner of a graph G is a sparse subgraph that preserves its shortes...
research
08/27/2018

Optimal Grid Drawings of Complete Multipartite Graphs and an Integer Variant of the Algebraic Connectivity

How to draw the vertices of a complete multipartite graph G on different...
research
10/19/2015

Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes

Consider a regular triangulation of the convex-hull P of a set A of n p...

Please sign up or login with your details

Forgot password? Click here to reset