The minimum size of fully irregular oriented graphs

https://doi.org/10.1016/S0012-365X(00)00446-5Get rights and content
Under an Elsevier user license
open archive

Abstract

Digraphs in which any two vertices have different pairs of semi-degrees are called fully irregular. For n-vertex fully irregular oriented graphs (i.e. digraphs without loops or 2-dicycles) the minimum size is presented.

Keywords

Irregular digraph
Oriented graph
Minimum size

Cited by (0)