3 papers
math.CO2022
On Lyndon-Word Representable Graphs
Hossein Teimoori Faal
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,…
math.CO2022
On Clique Incidence Matrices and Derivatives of Clique Polynomials
Hossein Teimoori Faal
The ordinary generating function of the number of complete subgraphs (cliques) of , denoted by , is called the The clique polynomial of the graph . In this paper, we…
math.HO2022
A Generalization of Tepper's Identity
Mortaza Bayat, Hossein Teimoori Faal
In this paper, we first give a simple combinatorial proof of Tepper's identity. Then, as a by product of this interesting identity we present another proof of the well-known Wilson…