Extremal Irregular Digraphs

A digraph is called irregular if its distinct vertices have distinct degree pairs. An irregular digraph is called minimal (maximal) if the removal of any arc (addition of any new arc) results in a non-irregular digraph. It is easily seen that the minimum sizes among irregular n-vertex whether digrap...

Full description

Bibliographic Details
Published in:Discussiones Mathematicae Graph Theory
Main Authors: Górska Joanna, Skupień Zdzisław, Dziechcińska-Halamoda Zyta, Majcher Zofia, Michael Jerzy
Format: Article
Language:English
Published: University of Zielona Góra 2018-08-01
Subjects:
irregular digraph
oriented graph
minimal subdigraph
maximal subdigraph
asymptotic size
05c07
05c20
05c30
05c35
Online Access:https://doi.org/10.7151/dmgt.2031

Internet

https://doi.org/10.7151/dmgt.2031

Similar Items