Abstract: In this short note, we first associate a new simple undirected graph with a given word over an ordered alphabet of -letters. We will call it the Lyndon graph of that word. Then, we introduce the concept of the Lyndon-word representable graph as a graph isomorphic to a Lyndon graph of some word. Then, we introduce the generalized Stirling cycle number as the number words of length with distinct Lydon words in their Lyndon factorization over an ordered alphabet of -letters . Finally, we conclude the paper with several interesting open questions and conjectures for interested audiences.
This page was built for publication: On Lyndon-Word Representable Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6400323)
