Two Finite Simple Directed Graphs

Abstract

The main result of the paper is that in practically interesting situations determining the optimal number of colors in the proposed coloring is an NP-hard problem. A possible conclusion to draw from this result is that for practical transitive tournament search algorithms we have to develop approximate greedy coloring algorithms. It is an empirical fact that coloring the nodes of a graph can be used to speed up clique search algorithms. In directed graphs transitive sub tournaments can play the role of cliques. In order to speed up algorithms to locate large transitive tournaments we propose a scheme for coloring the nodes of a directed graph.

Authors and Affiliations

Dr. A. Rameshkumar

Keywords

Related Articles

Effect of Radiation and Oblateness on the Equilibrium Points in the Elliptic Restricted Three Body Problem

In this paper we have obtained the location of equilibrium points in the elliptic restricted three body problem. We suppose that the bigger primary is oblate and the smaller primary as radiating. We find the positions of...

Reliability Analysis of Six Unit Bridge and Parallel Series Networks With Critical and Non-Critical Human Errors

Humans play a pivotal role in the design, development and operational phases of engineering systems. Reliability evaluation of systems without taking into consideration the human element does not provide a realistic pict...

APPLICATION OF MIXED QUADRATURE FOR NUMERICAL EVALUATION OF FRACTIONAL INTEGRALS

In this paper, we improve the corrective factor approach using a mixed quadrature rule for numerical integration of fractional integral of order

Evaluation of M.T.T.F. and Variance Of A k-Out of N:G Redundant Complex System Under Waiting For Repair

This paper presents the investigations for the evaluation of reliability behavior of a k-out of N:G redundant complex system with r repair facilities incorporating the concept of waiting.

Solution of Fuzzy Multi-Objective Fractional Linear Programming Problem Using Fuzzy Programming Technique based on Exponential Membership Function

A method of solving multi-objective fuzzy fractional linear programming problem (MOFFLPP) is presented. All the coefficients of the fractional multi-objective functions and the constraints are taken to be fuzzy numbers....

Download PDF file
  • EP ID EP531698
  • DOI 10.5958/2320-3226.2018.00022.X
  • Views 125
  • Downloads 0

How To Cite

Dr. A. Rameshkumar (2018). Two Finite Simple Directed Graphs. Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics, 37(1), 223-229. https://europub.co.uk./articles/-A-531698