4 papers · 1 filter
Bipartite Turán Numbers of Trees and Star Forests
Omid Khormali
The bipartite Turán number of a graph , denoted , is the maximum number of edges in any -free bipartite graph with parts of size $|A| = m…
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 $…