Mahdi Anbarloei

activity

20132015

most citedA Bound for the Locating Chromatic Numbers of Trees

4 citations · 4 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2015

Gutman index of the Mycielskian and its complement

Ali Behtoei, Mahdi Anbarloei

In This Paper we study the Gutman index of the Mycielskian graphs and their complements.

math.CO2014

On the Randic and degree distance indices of the Mycielskian of a graph

Ali Behtoei, Mahdi Anbarloei

In a search for triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph into a new graph which is called t…

math.CO2013★ 4 cited

A Bound for the Locating Chromatic Numbers of Trees

Ali Behtoei, Mahdi Anbarloei

Let $f$ be a proper $k$ -coloring of a connected graph $G$ and $Π = (V_{1}, V_{2}, \dots, V_{k})$ be an ordered partition of $V (G)$ into the resulting color classes. For a vertex $v$ of $G$ ,…