Browsing by Subject "Graph theory"
Now showing items 16 of 6

Acyclic edge coloring of complete rpartite graphs
(Dhirubhai Ambani Institute of Information and Communication Technology, 2011)An acyclic edge coloring of a graph G is a proper edge coloring of G which has no dichromatic cycle. The minimum number of colors required to acyclically edge color graph G is called its acyclic chromatic index, denoted ... 
On path complexities of heapsort algorithm and the class stack
(Dhirubhai Ambani Institute of Information and Communication Technology, 2007)A measure of program complexity, called Path Complexity, based on the number of program execution paths as a function of the input size n, is proposed in [AJ05]. This measure can be used to compare the complexity of two ... 
Path complexity of maximum segment sum problem
(Dhirubhai Ambani Institute of Information and Communication Technology, 2009)Various software complexity metrics have been proposed in literature. A program complexity measure called path complexity is proposed in [1]. Path complexity P(A,n) of an algorithm A is defined to be the number of program ... 
Path complexity of the class binary search tree
(Dhirubhai Ambani Institute of Information and Communication Technology, 2009)Path complexity of a program is defined as the number of program execution paths as a function of input size n. This notion of program complexity has been extended to complexity of a class as follows. Class had data members ... 
Study of Total Graph Using Dynamic Graph Operation
(Dhirubhai Ambani Institute of Information and Communication Technology, 2017)"Auxiliary graphs are graphs which are used to translate one graph problem to another graph problem. Total graph is also an auxiliary graph which is used to translate the total coloring problem into the vertex coloring ... 
Study on shock graphs: graph representation of objects
(Dhirubhai Ambani Institute of Information and Communication Technology, 2013)A shock graph is an abstraction of a twodimensional shape of an object. It represents the shape as a graph, using its boundary information. In this thesis, we study the shock graph representation of twodimensional shapes. ...