Abstract
Short, elementary proofs of the optimal bounds for various path and cycle lengths are given for the zero-divisor graphs and digraphs of semigroups.
Mathematics Subject Classification:
Register now or learn more
PDF download + Online access
Issue Purchase
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.