End-Completely-Regular and End-Inverse Lexicographic Products of Graphs
Joint Authors
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-04-17
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Medicine
Information Technology and Computer Science
Abstract EN
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 give several approaches to construct new End-completely-regular graphs by means of the lexicographic products of two graphs with certain conditions.
In particular, we determine the End-completely-regular and End-inverse lexicographic products of bipartite graphs.
American Psychological Association (APA)
Hou, Hailong& Gu, Rui. 2014. End-Completely-Regular and End-Inverse Lexicographic Products of Graphs. The Scientific World Journal،Vol. 2014, no. 2014, pp.1-5.
https://search.emarefa.net/detail/BIM-1049610
Modern Language Association (MLA)
Hou, Hailong& Gu, Rui. End-Completely-Regular and End-Inverse Lexicographic Products of Graphs. The Scientific World Journal No. 2014 (2014), pp.1-5.
https://search.emarefa.net/detail/BIM-1049610
American Medical Association (AMA)
Hou, Hailong& Gu, Rui. End-Completely-Regular and End-Inverse Lexicographic Products of Graphs. The Scientific World Journal. 2014. Vol. 2014, no. 2014, pp.1-5.
https://search.emarefa.net/detail/BIM-1049610
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1049610
