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...

Descripción completa

Detalles Bibliográficos
Autores principales: Hou, Hailong, Gu, Rui
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4032769/
https://www.ncbi.nlm.nih.gov/pubmed/24892047
http://dx.doi.org/10.1155/2014/432073

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4032769/
https://www.ncbi.nlm.nih.gov/pubmed/24892047
http://dx.doi.org/10.1155/2014/432073

Ejemplares similares