6533b7d5fe1ef96bd126471a
RESEARCH PRODUCT
The minimum size of fully irregular oriented graphs
Zdzisław SkupieńJoanna GórskaZofia MajcherJerzy Michaelsubject
Discrete mathematicsCombinatoricsMathematics::CombinatoricsComputer Science::Discrete MathematicsDiscrete Mathematics and CombinatoricsMinimum sizeOriented graphIrregular digraphMathematicsTheoretical Computer Sciencedescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2001-06-01 | Discrete Mathematics |