A. Ghodrati

collaborators

2 papers

cs.DM2019

Well-indumatched Trees and Graphs of Bounded Girth

S. Akbari, T. Ekim, A. H. Ghodrati +1

A graph G is called well-indumatched if all of its maximal induced matchings have the same size. In this paper we characterize all well-indumatched trees. We provide a linear time…

math.CO2017

Chromatic Number and Dichromatic Polynomial of Digraphs

Saeed Akbari, Amir Hossein Ghodrati, Afrouz Jabalameli +1

Let $G$ be a graph of order $n$ . It is well-known that $α (G) \geq \sum_{i = 1}^{n} \frac{1}{1 + d _{i}}$ , where $α (G)$ is the independence number of $G$ and $d_{1}, \dots, d_{n}$ is the degree se…