There's a theorem/lemma that states that a finite directed acyclic graph (DAG) has at least one sink and at least one source. Is there a term for a (finite) DAG with ** exactly** one sink and one source?

(And while you're at it, any good background references for someone whose research just took a left turn into such DAGs?)