4 papers
From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
Omid Khormali, Ghaya Mtimet, Nuh Aydin
Motivated by a historical combinatorial problem that resembles the well-known Josephus problem, we investigate circular partition algorithms and formulate problems in deterministic…
On Link-irregular Digraphs
Alexander Bastien, Omid Khormali
We extend the study of link-irregular graphs to directed graphs (digraphs), where a digraph is link-irregular if no two vertices have isomorphic directed links. We establish that l…
On Link-irregular labelings of Graphs
Alexander Bastien, Omid Khormali
We introduce the concept of link-irregular labelings for graphs, extending the notion of link-irregular graphs through edge labeling with positive integers. A labeling is link-irre…
On the Regularity, Planarity and Edge Bounds of Link-irregular Graphs
Alexander Bastien, Omid Khormali
A graph is a link-irregular graph if every two distinct vertices of have non-isomorphic links. The link of a vertex in is the subgraph induced by the neighbors of $…