39 citations · 40 across the 8 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
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…
math.CO2015
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…