M. Saghafian

activity

20112026

most citedOn a Bounded Budget Network Creation Game

24 citations · 37 across the 21 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

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…

math.CO2017★ 1 cited

On $k$ -tuple and $k$ -tuple total domination numbers of regular graphs

Sharareh Alipour, Amir Jafari, Morteza Saghafian

Let $G$ be a connected graph of order $n$ , whose minimum vertex degree is at least $k$ . A subset $S$ of vertices in $G$ is a $k$ -tuple total dominating set if every vertex of $G$ i…

math.CO2017★ 8 cited

Is there any polynomial upper bound for the universal labeling of graphs?

Arash Ahadi, Ali Dehghan, Morteza Saghafian

A {\it universal labeling} of a graph $G$ is a labeling of the edge set in $G$ such that in every orientation $ℓ$ of $G$ for every two adjacent vertices $v$ and $u$ , the sum of…

Chromatic Number and Dichromatic Polynomial of Digraphs

On k-tuple and k-tuple total domination numbers of regular graphs

Is there any polynomial upper bound for the universal labeling of graphs?

On $k$ -tuple and $k$ -tuple total domination numbers of regular graphs