39 citations · 40 across the 8 of their papers we have counts for
11 papers
Local Clique Covers and Chromatic Number
Akbar Davoodi
The local clique cover number is the minimum valency of an edge-clique cover of . We prove the conjectured inequality for every finite simple…
Exact Recovery in the Data Block Model
Amir R. Asadi, Akbar Davoodi, Ramin Javadi +1
Community detection in networks is a fundamental problem in machine learning and statistical inference, with applications in social networks, biological systems, and communication…
On the total versions of 1-2-3-conjecture for graphs and hypergraphs
Akbar Davoodi, Leila Maherani
In 2004, Karoński, Łuczak and Thomason proposed ---conjecture: For every nice graph there is an edge weighting function such that the in…
On a Conjecture of Erd\H os on Size Ramsey Number of Star Forests
Akbar Davoodi, Ramin Javadi, Azam Kamranian +1
Given graphs and , we say that is Ramsey for and we write , if for every edge coloring of by red and blue, there is eithe…
On Clique Coverings of Complete Multipartite Graphs
Akbar Davoodi, Dániel Gerbner, Abhishek Methuku +1
A clique covering of a graph is a set of cliques of such that any edge of is contained in one of these cliques, and the weight of a clique covering is the sum of the si…
Clique Coverings and Claw-free Graphs
Csilla Bujtás, Akbar Davoodi, Ervin Győri +1
Let be a clique covering for and let be a vertex of . The valency of vertex (with respect to ), denoted by , is the number of cl…
An Erdős-Gallai type theorem for uniform hypergraphs
Akbar Davoodi, Ervin Győri, Abhishek Methuku +1
A well-known theorem of Erdős and Gallai asserts that a graph with no path of length contains at most edges. Recently Győri, Katona and Lemons gave an exten…
A characterization of some graphs with metric dimension two
Ali Behtoei, Akbar Davoodi, Mohsen Jannesari +1
A set W \subseteq V (G) is called a resolving set, if for each pair of distinct vertices u,v \in V (G) there exists t \in W such that d(u,t) \neq d(v,t), where d(x,y) is the distan…
Sigma clique covering of graphs
Akbar Davoodi, Ramin Javadi, Behnaz Omoomi
The sigma clique cover number (resp. sigma clique partition number) of graph G, denoted by scc(G) (resp. scp(G)), is defined as the smallest integer k for which there exists a coll…
Pairwise Balanced Designs and Sigma Clique Partitions
Akbar Davoodi, Ramin Javadi, Behnaz Omoomi
In this paper, we are interested in minimizing the sum of block sizes in a pairwise balanced design, where there are some constraints on the size of one block or the size of the la…
On the 1-2-3-conjecture
Akbar Davoodi, Behnaz Omoomi
A k-edge-weighting of a graph G is a function w: E(G)->{1,2,...,k}. An edge-weighting naturally induces a vertex coloring c, where for every vertex v in V(G), c(v) is sum of weight…