Loading...
End-Completely-Regular and End-Inverse Lexicographic Products of Graphs
A graph X is said to be End-completely-regular (resp., End-inverse) if its endomorphism monoid End(X) is completely regular (resp., inverse). In this paper, we will show that if X[Y] is End-completely-regular (resp., End-inverse), then both X and Y are End-completely-regular (resp., End-inverse). We...
Na minha lista:
| Main Authors: | , |
|---|---|
| Format: | Artigo |
| Sprog: | Inglês |
| Udgivet: |
Hindawi Publishing Corporation
2014
|
| Fag: | |
| Online adgang: | https://ncbi.nlm.nih.gov/pmc/articles/PMC4032769/ https://ncbi.nlm.nih.gov/pubmed/24892047 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1155/2014/432073 |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|