12 citations · 28 across the 18 of their papers we have counts for
24 papers · 1 filter
Star edge coloring of Cactus graphs
Behnaz Omoomi, Marzieh Vahid Dastjerdi, Yasaman Yektaeian
A star edge coloring of a graph is a proper edge coloring of such that no path or cycle of length four is bi-colored. The star chromatic index of , denoted by $χ^{\prime…
A Polynomial Time Algorithm to Find the Star Chromatic Index of Trees
Behnaz Omoomi, Elham Roshanbin, Marzieh Vahid Dastjerdi
A star edge coloring of a graph is a proper edge coloring of such that every path and cycle of length four in uses at least three different colors. The star chromatic i…
Star Edge Coloring of the Cartesian Product of Graphs
Behnaz Omoomi, Marzieh Vahid Dastjerdi
A star edge coloring of a graph is a proper edge coloring of such that every path and cycle of length four in uses at least three different colors. The star chromatic i…
Clique-coloring of -minor free graphs
Behnaz Omoomi, Maryam Taleb
A clique-coloring of a given graph is a coloring of the vertices of such that no maximal clique of size at least two is monocolored. The clique-chromatic number of is t…
Injective chromatic number of outerplanar graphs
Mahsa Mozafari-Nia, Behnaz Omoomi
An injective coloring of a graph is a vertex coloring where two vertices with common neighbor receive distinct colors. The minimum integer that has a injective coloring…
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 simultaneous edge coloring of graphs
Behrooz Bagheri Gh., Behnaz Omoomi
On the simultaneous edge coloring of graphs
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…
Relations between Metric Dimension and Domination Number of Graphs
Behrooz Bagheri Gh., 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…
On the Locating Chromatic Number of the Cartesian Product of Graphs
Ali Behtoei, Behnaz Omoomi
Let be a proper -coloring of a connected graph and be an ordered partition of into the resulting color classes. For a vertex of , the…
On the locating chromatic number of Kneser graphs
Ali Behtoei, Behnaz Omoomi
Let be a proper -coloring of a connected graph and be an ordered partition of into the resulting color classes. For a vertex of , the…
Characterization of n-Vertex Graphs with Metric Dimension n-3
Mohsen Jannesari, Behnaz Omoomi
For an ordered set of vertices and a vertex in a connected graph , the ordered -vector is called the (m…
Characterization of Randomly k-Dimensional Graphs
Mohsen Jannesari, Behnaz Omoomi
For an ordered set of vertices and a vertex in a connected graph , the ordered -vector is called the (met…
The Metric Dimension of Lexicographic Product of Graphs
Mohsen Jannesari, Behnaz Omoomi
For an ordered set of vertices and a vertex in a connected graph , the ordered -vector is called the (m…
On Randomly k-Dimensional Graphs
Mohsen Jannesari, Behnaz Omoomi
For an ordered set of vertices and a vertex in a connected graph , the ordered -vector is called the (m…
Constructing regular graphs with smallest defining number
Behnaz Omoomi, Nasrin Soltankhah
In a given graph , a set of vertices with an assignment of colors is a {\sf defining set of the vertex coloring of }, if there exists a unique extension of the colors of…