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

Neighborhood Cordial (Nhd-C) Labeling - A New Method of Graph Labeling

We introduce a new technique of graph labeling named as Neighborhood Cordial (Nhd-C) Labeling of Graphs and show that paths, cycles, FL (Cn), S (C3,n), pathunion Pm(C3), Pm (C4),K1,m: K1,m , TreeYn are nhd-c graphs.

ON DIVISOR CORDIAL GRAPH

In this paper we prove that some known graphs such as the Herschel graph and some graphs constructed in this paper are divisor cordial graphs.

On Sequential Graphs

A labeling or valuation of a graph G is an assignment f of labels to the vertices of G that indices for each edge xy a label depending on the vertex labels f(x) and f(y). In this paper we study some classes of graphs whi...

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

EQUATIONS OF MOTION IN OUT OF PLANE PHOTOGRAVITATIONAL ELLIPTIC RESTRICTED THREE BODY PROBLEMS WITH SMALLER PRIMARY OBLATE

We consider out of plane photogravitational elliptic restricted three body problem. We suppose that the bigger primary is radiating and the smaller one is an oblate spheroid. We find the forces acting due to radiation an...

Download PDF file
  • EP ID EP531698
  • DOI 10.5958/2320-3226.2018.00022.X
  • Views 130
  • 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