A vertex set X of a graph G is an association set if each component of G− X is a clique, and a
dissociation set if each of these cliques has only one or two vertices. We observe some …

Given a graph $ G $ and an integer $ b $, Bandwidth asks whether there exists a bijection
$\pi $ from $ V (G) $ to $\{1,\ldots,| V (G)|\} $ such that $\max_ {\{u, v\}\in E (G)}|\pi (u)-\pi …

Distance parameters are extensively used to design efficient algorithms for many hard graph
problems. They measure how far a graph is from belonging to some class of graphs. If a …

The boxicity of a graph G (V, E) is the minimum integer k such that G can be represented as
the intersection graph of axis parallel boxes in R k. Cubicity is a variant of boxicity, where the …

The thesis is divided into three parts. The first part deals with the Erdös-Posa property of
cycles. The second part presents several results concerning geometric graph …