✦ LIBER ✦

On End-regular graphs

✍ Scribed by Suohai Fan

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 390 KB
Volume: 159
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00101-2

No coin nor oath required. For personal study only.

✦ Synopsis

A graph X is End-regular if its endomorphism monoid End X is regular in the sernigroup sense, that is, for any fin End X there exists g in End X with fgf=f. End-regular bipartite graphs were characterized in [l]. In this paper, End-regular graphs are obtained through the lexicographic product of End-regular graphs, and strong End-regular graphs (End-orthodox graphs) are investigated.

📜 SIMILAR VOLUMES

On regular graphs. II

✍ D.Z̆ Djoković 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 411 KB

On regular graphs. III

✍ I.Z Bouwer; D.Ž Djoković 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 580 KB

On regular graphs. IV

✍ D.Ž Djoković 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 280 KB

On regular graphs, V

✍ Dragomir Ž Djoković 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 550 KB

On regular graphs, VI

✍ Dragomir Ž Djoković 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 391 KB

On regular self-complementary graphs

✍ Nora Hartsfield 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 74 KB

A regular self-complementary graph is presented which has no complementing permutation consisting solely of cycles of length four. This answers one of Kotzig's questions.