Skip to main content
خانه
Dr. Behnaz Omoomi
Professor of Mathematical Sciences

Articles

type:
Title Date
Local Chromatic Number of Graphs -
Fostering Peer Learning with a Game-Theoretical Approach in a Blended Learning Environment -
On the defining sets of some special graphs -
Complexity reduction of throughput optimal link scheduling algorithm through topology control in wireless networks -
On the locating chromatic number of the cartesian product of graphs -
On the Dominating Coloring -
Star edge coloring of the Cartesian product of graphs -
Local coloring of the Kneser graphs -
An optimal traffic distribution method supporting end-to-end delay bound -
Characterization of randomly k-dimensional graphs -
On the Star Coloring of Graphs -
A Havel-Hakimi type problem for oriented graphs -
Locally rainbow graphs -
Local clique covering of claw-free graphs -
Combinatorial Game Theory -
The Incidence Chromatic Number of Graphs with Maximum Degree Four -
Graph Coloring: Various Types, Applications and Open Problems -
On construction of involutory MDS matrice from Vandermonde Matrices in GF(2q) -
On the simultaneous edge coloring of graphs -

Pagination

  • First page « First
  • Previous page ‹‹
  • Page 1
  • Page 2
  • Page 3
  • Page 4
  • Page 5
  • Page 6
  • Page 7

Main navigation

  • Login
  • Manual
  • University Home Page
  • Home
  • Index

Provided by Information Technology Manager of Isfahan University of Technology (https://it.iut.ac.ir)

Support and send ticket

تحت نظارت وف بومی