Journal ArticleOPEN ACCESS

Endomorphism - Regularity of Split Graphs

European Journal of Combinatorics (2001) 22(2) 207-216
DOI: 10.1006/eujc.2000.0443
41Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, split graphs with a regular endomorphism monoid are characterized explicity. © 2001 Academic Press.

Cite

CITATION STYLE

APA

Li, W., & Chen, J. (2001). Endomorphism - Regularity of Split Graphs. European Journal of Combinatorics, 22(2), 207–216. https://doi.org/10.1006/eujc.2000.0443

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free