Abstract
A graph X is said to be End-orthodox if its endomorphism monoid End(X) is an orthodox semigroup. In this paper, we characterize the endomorphism monoid of the join of n split graphs. We give the conditions under which the endomorphism monoid of a join of n split graphs is orthodox.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Godsil, C., Royle, G.: Algebraic Graph Theory. Springer, New York (2000)
Howie, J.M.: Fundamentals of Semigroup Theory. Clarendon Press, Uxford (1995)
Fan, S.: Retractions of Split Graphs and End-orthodox Split Graphs. Discrete Mathematics 257, 161–164 (2002)
Hou, H., Feng, A.: End-regularity of the join of n split graphs (to appear)
Li, W.: Graphs with Regular Monoid. Discrete Mathematics 265, 105–118 (2003)
Li, W., Chen, J.: Endomorphism-regularity of Split Graphs. European Journal of Combinatorics 22, 207–216 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hou, H., Feng, A., Gu, R. (2013). End-Orthodox Graphs Which Are the Join of N Split Graphs. In: Du, Z. (eds) Proceedings of the 2012 International Conference of Modern Computer Science and Applications. Advances in Intelligent Systems and Computing, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33030-8_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-33030-8_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33029-2
Online ISBN: 978-3-642-33030-8
eBook Packages: EngineeringEngineering (R0)