Log In Sign Up

Sequences of radius k for complete bipartite graphs

by   Michał Dębski, et al.

A k-radius sequence for a graph G is a sequence of vertices of G (typically with repetitions) such that for every edge uv of G vertices u and v appear at least once within distance k in the sequence. The length of a shortest k-radius sequence for G is denoted by f_k(G). We give an asymptotically tight estimation on f_k(G) for complete bipartite graphs which matches a lower bound, valid for all bipartite graphs. We also show that determining f_k(G) for an arbitrary graph G is NP-hard for every constant k>1.


page 1

page 2

page 3

page 4


Monitoring the edges of a graph using distances

We introduce a new graph-theoretic concept in the area of network monito...

On the Representation Number of Bipartite Graphs

A word-representable graph is a simple graph G which can be represented ...

Red Domination in Perfect Elimination Bipartite Graphs

The k red domination problem for a bipartite graph G=(X,Y,E) is to find ...

Kempe equivalence of almost bipartite graphs

Two vertex colorings of a graph are Kempe equivalent if they can be tran...

Optimization over Degree Sequences of Graphs

We consider the problem of finding a subgraph of a given graph minimizin...

Tight Cuts in Bipartite Grafts I: Capital Distance Components

This paper is the first from a series of papers that provide a character...