Separation Dimension of Graphs and Hypergraphs

Basavaraju, Manu and Chandran, Sunil L and Golumbic, Martin Charles and Mathew, Rogers and Rajendraprasad, Deepak (2016) Separation Dimension of Graphs and Hypergraphs. In: 40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), JUN 25-27, 2014, Nouan le Fuzelier, FRANCE, pp. 187-204.

PDF Alg_75-1_187_2016.pdf - Published Version Restricted to Registered users only Download (529kB) | Request a copy

Abstract

Separation dimension of a hypergraph H, denoted by , is the smallest natural number k so that the vertices of H can be embedded in such that any two disjoint edges of H can be separated by a hyperplane normal to one of the axes. We show that the separation dimension of a hypergraph H is equal to the boxicity of the line graph of H. This connection helps us in borrowing results and techniques from the extensive literature on boxicity to study the concept of separation dimension. In this paper, we study the separation dimension of hypergraphs and graphs.

Item Type:	Conference Proceedings
Publication:	ALGORITHMICA
Publisher:	SPRINGER
Additional Information:	Copy right for this article belongs to the SPRINGER, 233 SPRING ST, NEW YORK, NY 10013 USA
Keywords:	Separation dimension; Boxicity; Scrambling permutation; Line graph; Acyclic chromatic number
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	10 Jun 2016 07:13
Last Modified:	10 Jun 2016 07:13
URI:	http://eprints.iisc.ac.in/id/eprint/53875

Actions (login required)

View Item