Highly irregular digraphs (Q686429): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jian-fang Wang / rank
Normal rank
 
Property / author
 
Property / author: Jian-fang Wang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly irregular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4207923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:09, 22 May 2024

scientific article
Language Label Description Also known as
English
Highly irregular digraphs
scientific article

    Statements

    Highly irregular digraphs (English)
    0 references
    0 references
    0 references
    0 references
    28 February 1994
    0 references
    A graph \(G\) is highly irregular if for each vertex \(v\) of \(G\) no two vertices adjacent with \(v\) have the same degree in \(G\). The authors extend this concept to digraphs as follows: A digraph \(D\) is highly irregular if for every vertex \(v\) of \(D\) no two vertices in the out neighbourhood of \(v\) have the same out degree in \(D\). The authors extend several of the results that are known for highly irregular graphs to highly irregular digraphs.
    0 references
    highly irregular digraphs
    0 references
    0 references
    0 references
    0 references

    Identifiers