Browsing Computer Science and Automation (CSA) by Advisor "Chandran, L Sunil"
Now showing items 16 of 6

Acyclic Edge Coloring Of Graphs
(20131007)A proper edge coloring of G =(V,E)is a map c : E → C (where C is the set of available colors ) with c(e) ≠ c(ƒ) for any adjacent edges e,f. The minimum number of colors needed to properly color the edges of G, is called ... 
Boxicity And Cubicity : A Study On Special Classes Of Graphs
(20140602)Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exists a mapping f : V (G)→ F such that, An interval graph is an intersection graph of a family of closed intervals on the ... 
Boxicity, Cubicity And Vertex Cover
(20100928)The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a ddimensional axisparallel box in Rd such that two boxes intersect if and only if the corresponding ... 
Intersection Graphs Of Boxes And Cubes
(20110125)A graph Gis said to be an intersection graph of sets from a family of sets if there exists a function ƒ : V(G)→ such that for u,v V(G), (u,v) E(G) ƒ (u) ƒ (v) ≠ . Interval graphs are thus the intersection graphs ... 
Rainbow Colouring and Some Dimensional Problems in Graph Theory
(20180405)This thesis touches three diﬀerent topics in graph theory, namely, rainbow colouring, product dimension and boxicity. Rainbow colouring An edge colouring of a graph is called a rainbow colouring, if every pair of vertices ... 
Rainbow Connection Number Of Graph Power And Graph Products
(20140909)The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. ...