Two Finite Simple Directed Graphs
Journal Title: Bulletin of Pure and Applied Sciences Sec. E - Mathematics and Statistics - Year 2018, Vol 37, Issue 1
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
- EP ID EP531698
- DOI 10.5958/2320-3226.2018.00022.X
- Views 122
- Downloads 0
ON FUNCTIONS OF A SINGLE MATRIX ARGUMENT - III
We prove some Eulerian integrals involving the hypergeometric functions of single matrix argument. The integrals studied here involve the and the functions of matrix argument. We apply the Mathai’s matrix transform t...
DOMINATION IN CARTESIAN PRODUCT OF FUZZY GRAPHS USING STRONG ARC
In this paper the domination in fuzzy graphs by using strong arcs are generalized and established the domination concept in Cartesian product on standard fuzzy graphs using strong arcs and non strong arcs
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...
A Condition on the Masses of Composite Particles
Based on the recent formulation of the standard model with the spinor space given by a direct sum of tensor products of modules isomorphic to division algebras, these algebras are used to derive an expression for masses...
A STUDY ON THE EFFECTIVE EDGES IN THE CARTESIAN PRODUCT OF FUZZY GRAPHS
In this paper we discuss the number of effective edges in the Cartesian product of fuzzy graphs. Some basic theorems and results are obtained on effective edges. Based on the results we find the effective edge domination...