$n$-Functional digraphs uniquely determined by the skeleton

Konrad Pióro¹

¹ Institute of Mathematics Warsaw University Banacha 2 02-097 Warszawa, Poland

Colloquium Mathematicum, Tome 91 (2002) no. 1, pp. 79-89.

Résumé

We show that any total $n$-functional digraph $D$ is uniquely determined by its skeleton up to the orientation of some cycles and infinite chains. Next, we characterize all graphs $G$ such that each $n$-functional digraph obtained from $G$ by directing all its edges is total. Finally, we describe finite graphs whose edges can be directed to form a total $n$-functional digraph without cycles.

Détail

DOI : 10.4064/cm91-1-6

Keywords: total n functional digraph uniquely determined its skeleton orientation cycles infinite chains characterize graphs each n functional digraph obtained directing its edges total finally describe finite graphs whose edges directed form total n functional digraph without cycles