End-regular and End-orthodox lexicographic products of bipartite graphs

DOI10.1080/09720529.2014.927639zbMATH Open1495.05277OpenAlexW2560994255MaRDI QIDQ5069836FDOQ5069836

Authors: Rui Gu, Hailong Hou, Youlin Shang 

Publication date: 19 April 2022

Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720529.2014.927639

zbMATH Keywords

bipartite graphendomorphismlexicographic product

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph operations (line graphs, products, etc.) (05C76) Semigroups of transformations, relations, partitions, etc. (20M20)

Cites Work

• Title not available (Why is that?)
• Algebraic graph theory. Morphisms, monoids and matrices
• Title not available (Why is that?)
• On End-regular graphs
• Graphs with regular monoids
• Graphs with a regular endomorphism monoid
• A regular endomorphism of a graph and its inverses
• Title not available (Why is that?)
• End-regular and End-orthodox joins of split graphs.
• Problems raised at the Problem Session of the Colloquium on Semigroups in Szeged, August 1987
• Endomorphism-regularity of split graphs
• Endomorphism spectra of graphs
• The endomorphism monoid of \(\overline{P_n}\).
• Graphs whose endomorphism monoids are regular

Cited In (1)

• Subbasic open sets in graphs generated by monophonic eccentric neighborhoods

This page was built for publication: End-regular and End-orthodox lexicographic products of bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069836)