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

DOI10.1515/math-2016-0021zbMath1346.05110OpenAlexW2325849249MaRDI QIDQ317854

Rui Gu, Hai-long Hou

Publication date: 4 October 2016

Published in: Open Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/math-2016-0021

zbMATH Keywords

bipartite graphendomorphismmonoidgeneralized lexicographic product

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

Generalization of bipartite graphs ⋮ End-regular and End-orthodox generalized lexicographic products of bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• End-regular and End-orthodox generalized lexicographic products of bipartite graphs
• Problems raised at the Problem Session of the Colloquium on Semigroups in Szeged, August 1987
• Endomorphism spectra of graphs
• The endomorphism monoid of \(\overline{P_n}\).
• Graphs whose endomorphism monoids are regular
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• On End-regular graphs
• On transitive Cayley graphs of groups and semigroups
• Graphs with regular monoids
• Graphs with a regular endomorphism monoid
• On the Endomorphism Monoid of K(n,3)
• A regular endomorphism of a graph and its inverses
• Algebraic graph theory. Morphisms, monoids and matrices
• Endomorphism-regularity of split graphs