Browsing M Tech Dissertations by Author "Muthu, Rahul"

Now showing items 1-14 of 14

    • Acyclic edge coloring of complete r-partite graphs 

      Teja, V. Krishna (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 ...

    • Acyclic edge colouring of subgraphs of hypercubes 

      Soni, Maulik (Dhirubhai Ambani Institute of Information and Communication Technology, 2020)
      Acyclic edge colouring is a very important combinatorial optimization problem, which many researchers are currently working on. Acyclic edge colouring is assignment of colours to vertices or edges of the graph such that, ...

    • Characterization of Realization Graphs 

      Seksaria, Khushboo (Dhirubhai Ambani Institute of Information and Communication Technology, 2017)
      "Given a degree sequence d, usually it generates several different realizations belonging to several distinct isomorphism classes. In general, the structure of an arbitrary realization cannot be known from its degree ...

    • Counting number of minimum spanning trees 

      Sompura, Jigar (2020)
      The problem discussed in this thesis is "To find all k instances for given n, where 1 k nn��2, n is number of vertices and k is number of minimum weight spanning trees by any weight assignments to the edges of a complete ...

    • Packet forwarding strategies for cooperation enforcement in mobile wireless ad hoc networks 

      Patel, Nidhi (Dhirubhai Ambani Institute of Information and Communication Technology, 2011)
      In self-organized ad hoc networks, all networking functions rely on the contri- bution of the relay nodes. Nodes have to forward packets for each other in order to enable multi-hop communication. In recent years, researchers ...

    • Set labeling of graphs 

      Kumar, Lokesh (Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
      Given a universal set and its subsets, intersection graph can be characterized as the graph with one distinct subset of given universal set for each vertex of the graph and any two non-adjacent vertices have no element ...

    • Structural properties of realization graphs 

      Sapara, Dhara (2020)
      All graphs considered in this thesis are simple undirected graphs with finite, nonempty vertex sets. Degree sequence is one of the simplest terms associated with a graph. However, most graph families are not degree determined. ...

    • Study of Total Graph Using Dynamic Graph Operation 

      Patel, Dhaval (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 ...

    • Tensor Product and Acyclic Edge Colouring 

      Shihora, Rutvi (Dhirubhai Ambani Institute of Information and Communication Technology, 2017)
      "The assignment of colours to the edges of graph G such that no two adjacent edges get the same colour and there is no 2-coloured cycle in G is known as Acyclic Edge Colouring. The minimum number of colours needed to ...

    • The Study of Cycles in 2-connected Graphs Specifically Odd Graphs 

      Thakker, Avani (Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
      Counting the number of cycles in an undirected graph is a classical problemwhich is known to be intractable and so research on this problem typically focuses on approximation algorithms, special cases, heuristics and some ...

    • The Study of Vertex Coloring Algorithms Using Heuristic Approaches 

      Lodha, Pratik (Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
      Graph vertex coloring is one of the most studied NP-complete optimization problem (READ, 1972) [2]. The problem is that; given a graph G, determine the number of colors required to color G, so that no two adjacent vertices ...

    • Total graph and its characteristics 

      Patel, Brijeshkumar (Dhirubhai Ambani Institute of Information and Communication Technology, 2016)
      Graphs constructed by applying some specific rule to any given graph are calledauxiliary graphs. Such graphs are often used to translate one graph problem intoanother. Auxiliary graphs can be viewed as a function from the ...

    • Total graphs properties of total graphs and dynamic construction of total graphs 

      Sheth, Heli (Dhirubhai Ambani Institute of Information and Communication Technology, 2018)
      This thesis involves studying total graphs which are auxiliary graphs used to transform the total colouring problem of a graph into vertex colouring problem of the total graph. Not all graphs are total graphs but each ...

    • Traffic driven topology control for network lifetime maximization 

      Agrawal, Rupesh (Dhirubhai Ambani Institute of Information and Communication Technology, 2012)
      Energy consumption is a major concern in ad hoc wireless networks. Network life-time can be maximized by minimizing the network power consumption. Topology control is one of the most important mechanisms used for reducing ...