The hamiltonicity on the competition graphs of round digraphs
- 6 Downloads
Given a digraph D = (V, A), the competition graph G of D, denoted by C(D), has the same set of vertices as D and an edge between vertices x and y if and only if ND+(x)∩ND+(y) 6≠0. In this paper, we investigate the competition graphs of round digraphs and give a necessary and suffcient condition for these graphs to be hamiltonian.
Keywordsround digraph competition graph connected component hamiltonian
MR Subject Classification05C20 05C45 05C75
Unable to display preview. Download preview PDF.
We express our sincere thanks to the referees for their valuable suggestions and detailed comments.
- J E Cohen. Interval graphs and food webs: a finding and a problem, Rand Corporation Document 17696-PR, Santa Monica, CA, 1968.Google Scholar
- S R Kim. Competition graphs and scientific laws for food webs and other systems, PhD Thesis, Rutgers University, 1988.Google Scholar