Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Physical Sciences and Mathematics
On P-Competition Graphs Of Loopless Hamiltonian Digraphs Without Symmetric Arcs And Graph Operations, Kuniharu Yokomura, Morimasa Tsuchiya
On P-Competition Graphs Of Loopless Hamiltonian Digraphs Without Symmetric Arcs And Graph Operations, Kuniharu Yokomura, Morimasa Tsuchiya
Theory and Applications of Graphs
For a digraph D, the p-competition graph Cp(D) of D is the graph satisfying the following: V(Cp(D))=V(D), for x,y ∈ V(Cp(D)), xy ∈ E(Cp(D)) if and only if there exist distinct p vertices v1, v2, ..., vp ∈ V(D) such that x → vi, y → vi ∈ A(D) for each i=1,2, ..., p.
We show the H1 ∪ H2 is a p-competition graph of a loopless digraph without symmetric arcs for p ≥ 2 , where …