# Sequences of radius k for complete bipartite graphs

Debski, M and Lonc, Z and Rzazewski, Pavel Michael
(2017)
*Sequences of radius k for complete bipartite graphs.*
DISCRETE APPLIED MATHEMATICS, 225.
pp. 51-63.
ISSN 0166-218X
10.1016/j.dam.2017.03.017

Text
Debski_51_3297239_z.pdf Restricted to Registered users only Download (459kB) |

## Abstract

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. (C) 2017 Elsevier B.V. All rights reserved.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | Maximum cut; Bipartite graphs; k-radius sequences |

Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |

Divisions: | Informatics Laboratory |

SWORD Depositor: | MTMT Injector |

Depositing User: | MTMT Injector |

Date Deposited: | 30 Nov 2017 19:47 |

Last Modified: | 30 Nov 2017 19:47 |

URI: | https://eprints.sztaki.hu/id/eprint/9222 |

Update Item |