Welcome to Dr. Behnaz Omoomi

No front page content has been created yet.

Office : Room #95, Department of Mathematical Sciences, IUT Email : bomoomi@iut.ac.ir Phone : +98 313 3913652 Fax : +98 313 3912602 Web Site : Behnaz Omoomi

Professor of Mathematical Sciences

Research Fields : Combinatorics

Graph Theory

Teaching

Last News

Recent Publications

Personalized Privacy Preserving Method for Social Networks Graph k-Anonymization

Star edge coloring of the Cartesian product of graphs

A polynomial time algorithm to find the star chromatic index of trees

Fostering Peer Learning with a Game-Theoretical Approach in a Blended Learning Environment

Star edge coloring of Cactus graphs

Injective chromatic number of outer planar graphs

Graph Coloring: Various Types, Applications and Open Problems

Star Edge Coloring of Cactus Graphs

A Havel-Hakimi type problem for oriented graphs

Clique-coloring of K3, 3-minor free graphs

Star Edge Coloring of Cartesian Product of Graphs

A characterization of some graphs with metric dimension two

Some lower bounds for the L-intersection number of graphs

Complexity reduction of throughput optimal link scheduling algorithm through topology control in wireless networks

Edge clique covering sum of graphs

Local clique covering of claw-free graphs

Pairwise balanced designs and sigma clique partitions

Small oriented cycle double cover of graphs

On the oriented perfect path double cover conjecture

Bounds on Some Variants of Clique Cover Numbers

An Enforced Hill Climbing Based System for General Game Playing

On the 1-2-3-conjecture

Set Intersection Representations of Graphs

On the simultaneous edge coloring of graphs

Bike Share Station Location using Graph Domination Set in Graphs

Metric Dimension of Graphs

An optimal traffic distribution method supporting end-to-end delay bound

2-Trees with Metric Dimension Two

Some Graphs with Vertex-Coloring 2-Edge Weighting

Randomly Dimensional Graphs

Locating Chromatic Number of Graphs

On Vertex-Coloring 2-Edge-Weighting of Graphs

Characterization of a Class of Hamiltonian Connected Graphs

The Incidence Chromatic Number of Graphs with Maximum Degree Four

A Note on the p-Prime Algorithm for Solving the Maximum Independent Set Problem

On the Star Coloring of Graphs

On the Total Restrained Domination Number

On the Dominating Coloring

On the b-Coloring of Some Special Graphs

Local Chromatic Number of Graphs

Distance Locating Sets in Graphs

On the Defining Numbers of Cartesian Product of Cycles

Chromatic Classes of Certain 2-Connected Graphs

Chromaticity of Generalised Polygon Trees

A New Bound for Defining Numbers of Regular Graphs

Search form

Welcome to Dr. Behnaz Omoomi

Teaching

Last News

Recent Publications

Error