Discrete MathematicsVolume 236, Issues 1–3, 6 June 2001, Pages 263-272The minimum size of fully irregular oriented graphsAuthor links open overlay panelZofia Majcher a, Jerzy Michael a, Joanna Górska b, Zdzisław Skupień bShow moreShareCitehttps://doi.org/10.1016/S0012-365X(00)00446-5Get rights and contentUnder an Elsevier user licenseopen archiveAbstractDigraphs 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.Previous article in issueNext article in issueKeywordsIrregular digraphOriented graphMinimum sizeRecommended articlesCited by (0)Copyright © 2001 Elsevier Science B.V. All rights reserved.