Title of article :
The minimum size of fully irregular oriented graphs Original Research Article
Author/Authors :
Zofia Majcher، نويسنده , , Jerzy Michael، نويسنده , , Joanna G?rska، نويسنده , , Zdzis?aw Skupie?، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
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 :
Minimum size , Irregular digraph , Oriented graph
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
