Vertex removal in biclique graphs

06/08/2020
by   Leandro Montero, et al.
0

A biclique is a maximal bipartite complete induced subgraph. The biclique graph of a graph H, denoted by KB(H), is the intersection graph of the family of all bicliques of H. In this work we address the following question: Given a biclique graph G=KB(H), is it possible to remove a vertex β of G, such that G - {β} is a biclique graph? And if possible, can we obtain a graph H' such that G - {β} = KB(H')? We show that the general question has a “no” for answer. However, we prove that if G has a vertex β such that d(β) = 2, then G-{β} is a biclique graph and we show how to obtain H'.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/31/2017

Distances between bicliques and structural properties of bicliques in graphs

A biclique is a maximal bipartite complete induced subgraph of G. The bi...
research
03/30/2020

Subgraph densities in a surface

Given a fixed graph H that embeds in a surface Σ, what is the maximum nu...
research
08/19/2019

On the edge-biclique graph and the iterated edge-biclique operator

A biclique of a graph G is a maximal induced complete bipartite subgraph...
research
11/03/2022

A Round and Bipartize Approximation Algorithm for Vertex Cover

The vertex cover problem is a fundamental and widely studied combinatori...
research
11/05/2019

The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive

The Bron-Kerbosch algorithm is a well known maximal clique enumeration a...
research
01/23/2018

Signal Subgraph Estimation Via Vertex Screening

Graph classification and regression have wide applications in a variety ...
research
11/27/2021

A polynomial kernel for vertex deletion into bipartite permutation graphs

A permutation graph can be defined as an intersection graph of segments ...

Please sign up or login with your details

Forgot password? Click here to reset