The endomorphisms monoids of graphs of order n with a minimum degree n − 3
Saved in:
| Date: | 2014 |
|---|---|
| Main Authors: | N. Pipattanajinda, U. Knauer, B. Gyurov, S. Panma |
| Format: | Article |
| Language: | English |
| Published: |
2014
|
| Series: | Algebra and discrete mathematics |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000739193 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
A formula for the number of weak endomorphisms on paths
by: Knauer, Ulrich, et al.
Published: (2019)
by: Knauer, Ulrich, et al.
Published: (2019)
Similar Items
-
The endomorphisms monoids of graphs of order n with a minimum degree n − 3
by: Pipattanajinda, N., et al.
Published: (2014) -
The endomorphisms monoids of graphs of order \(n\) with a minimum degree \(n-3\)
by: Pipattanajinda, Nirutt, et al.
Published: (2018) -
The endomorphisms monoids of graphs of order \(n\) with a minimum degree \(n-3\)
by: Pipattanajinda, Nirutt, et al.
Published: (2018) -
The endomorphism monoids of (n − 3)-regular graphs of order n
by: N. Pipattanajinda, et al.
Published: (2016) -
The Endomorphism Monoids of (n − 3)-regular Graphs of Order n
by: Gyurov, B., et al.
Published: (2016)