A. Behjati

collaborators

2 papers

cs.DM2019

Some Results on Dominating Induced Matchings

Saieed Akbari, Hossein Baktash, Amin Behjati +2

Let $G$ be a graph, a dominating induced matching (DIM) of $G$ is an induced matching that dominates every edge of $G$ . In this paper we show that if a graph $G$ has a DIM, then $χ…

math.CO2016

Improving the Bounds On Murty_Simon Conjecture

Afrouz Jabalameli, Amin behjati, Morteza Saghafian +3

A graph is said to be diameter- $k$ -critical if its diameter is $k$ and removal of any of its edges increases its diameter. A beautiful conjecture by Murty and Simon, says that ever…