On p-competition graphs of loopless Hamiltonian digraphs without symmetric arcs and graph operations
For a digraph $D$, the $p$-competition graph $C_{p}(D)$ of $D$ is the graph satisfying the following: $V(C_{p}(D))=V(D)$, for $x,y \in V(C_{p}(D))$, $xy \in E(C_{p}(D))$ if and only if there exist distinct $p$ vertices $v_{1},$ $v_{2},$ $...,$ $v_{p}$ $\in$ $V(D)$ such that $x \rightarrow v_{i}$, $y...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Georgia Southern University
2022-07-01
|
| Series: | Theory and Applications of Graphs |
| Subjects: | |
| Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol9/iss2/3 |