n-Functional digraphs uniquely determined by the skeleton

• Autorzy: Konrad Pióro
• Języki publikacji: EN

Abstrakty

EN

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.

Kategorie tematyczne

• 05C20: Directed graphs (digraphs), tournaments
• 05C78: Graph labelling (graceful graphs, bandwidth, etc.)
• 05C99: None of the above, but in this section

• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Colloquium Mathematicum
• Rocznik: 2002
• Tom: 91
• Numer: 1
• Strony: 79-89

Daty

wydano

2002

Twórcy

autor

Konrad Pióro

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

Identyfikatory

DOI

10.4064/cm91-1-6