12 citations · 28 across the 18 of their papers we have counts for
7 papers · 2 filters
Some lower bounds for the -intersection number of graphs
Zeinab Maleki, Behnaz Omoomi
For a set of non-negative integers , the -intersection number of a graph is the smallest number for which there is an assignment on the vertices to subsets $A_v \subseteq…
A generalization of line graphs via link scheduling in wireless networks
Ali Ghiasian, Behnaz Omoomi, Hossein Saidi
In single channel wireless networks, concurrent transmission at different links may interfere with each other. To improve system throughput, a scheduling algorithm is necessary to…
Local Clique Covering of Graphs
Ramin Javadi, Zeinab Maleki, Behnaz Omoomi
A k-clique covering of a simple graph G, is an edge covering of G by its cliques such that each vertex is contained in at most k cliques. The smallest k for which G admits a k-cliq…
On the oriented perfect path double cover conjecture
Behrooz Bagheri Gh., Behnaz Omoomi
An {\sf oriented perfect path double cover} () of a graph is a collection of directed paths in the symmetric orientation of such that each edge of li…
Small oriented cycle double cover of graphs
Behrooz Bagheri Gh., Behnaz Omoomi
A small oriented cycle double cover (SOCDC)} of a bridgeless graph on vertices is a collection of at most directed cycles of the symmetric orientation, , of …
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…
Uniquely dimensional graphs
Behrooz Bagheri, Mohsen Jannesari, Behnaz Omoomi
A set is called a resolving set, if for each two distinct vertices there exists such that , where is the distan…