The endomorphisms monoids of graphs of order \(n\) with a minimum degree \(n-3\)

Nirutt Pipattanajinda, Ulrich Knauer, Boyko Gyurov, Sayan Panma

Abstract


We characterize the endomorphism monoids, \(End(G)\), of the generalized graphs \(G\) of order \(n\) with a minimum degree \(n-3\). Criteria for regularity, orthodoxy and complete regularity of those monoids based on the structure of \(G\) are given.


Keywords


Graph of order \(n\) which minimal degree \(n-3\), graph endomorphism, regular, orthodox, completely regular

Full Text:

PDF

Refbacks

  • There are currently no refbacks.