• HOME
  • Search & Results
  • Full Text
  • Thesis Details
 
Page: 173
 
 Full Screen

  • TITLE
  • CERTIFICATE
  • DECLARATION
  • ACKNOWLEDGEMENT
  • CONTENTS
  • INTRODUCTION
  • 1. PRELIMINARIES
  • 1.1 Introduction
  • 1.2 Basic Concepts
  • 1.3 Undirected & Directed graphs
  • 1.4 Directed walk, Path: Cycle
  • 1.5 Rooted Tree
  • 1.6 Clique
  • 1.7 Independent set or Stable set
  • 1.8. Perfect graph
  • 1.9 Comparability Graph
  • 1.10 Matrix representation of a graph
  • 1.11 Intersection Graphs
  • 1.12 Intersection Graphs having Specific Topological Pattern
  • 1.13 Intersection graphs of Subverts in a Tree
  • 1.14 Triangulated Graph [Choral Graph ]
  • 1.15 Interval Graphs
  • 1.16 The Circular - are graphs
  • 1.17 Circle Graph
  • 1.18 Overlap Graphs
  • 1.19 Block Graphs
  • 1.20 Path Graph
  • 1.21 Clique Separator
  • 1.22 Bipartite Intersect: on Graphs
  • 1.23 Complexity of Computer algorithms
  • 2. GRAPH POLYSEMY
  • 2.1 Introduction
  • 2.2 Polysemic Representation of Real numbers
  • 2.3 Polysemic Dominance Representation of Multiple Posets
  • 2.4 Polysemic Interval representation
  • 2.5 Graph Polysemy
  • 2.6 Properties of Graph Polysemy
  • 2.7 Polysemic Intersection representation of Bipartite graphs
  • 2.8 C - intersection representation of a bipartite graph G
  • 2.9 Polysemic intersection representation of bipartite graphs
  • 2.10 Intersection representation of k-partite graphs
  • 2.11 Polysemic intersection representation of k-partite graphs
  • 2.12 Polysemic Intersection Pairs
  • 2.13 Polysemic intersection representation of Block graphs
  • 3. POLYSAEMY OF SUBTREE GRAPHS
  • 3.1 Introduction
  • 3.2 Characteristics of Subtree graphs
  • 3.3 Characterization of Clique Trees
  • 3.4 Polysemic Intersection Representation of Subtree graphs
  • 3.5 Interval graphs
  • 3.6 The Circular - A-c Graphs
  • 4. RECOGNITION OF THE POLYSEMIC INTERSECTION PAIRS OF INTERVAL GRAPHS AND CIRCULAR - ARC GRAPHS
  • 4.1 Introduction
  • 4.2 Characterization of Polysemic Intersection Pairs of Interval Graphs
  • 4.3 Algorithm
  • 4.4 Recognition Of Polysemic Pair Of Circular Arc Graph
  • 4.5 Algorithm
  • 4.6 Hamiltonian Path
  • 5. POLYSEMY OF PATH GRAPHS
  • 5.1 Introduction
  • 5.2. Polysemy of Path Graphs
  • 5.3 Recognition of Polysemic Pair of Vertex Path Graphs
  • 6. POLYSEMY OF PERFECT VERTEX PATH GRAPHS AND COMPACT VERTEX PATH GRAPHS.
  • 6.1 Introduction
  • 6.2 Characteristics of Polysemic Pair of CV Graphs
  • 6.3 Characteristics of PV Graphs
  • 6.4 Polysemy of PV Graphs
  • 6.5 Recognition Of Polysemic Pair Of PV Graphs
  • 6.6 PV Graphs Are Intersection Polysemic with Strongly Chordal graphs.
  • 7. CONCLUSION
  • REFERENCES