Skip to main content
خانه
People
Isfahan University of Technology

Finding Contents or People

On the locating chromatic number of the cartesian product of graphs
Max-min total restrained domination number
An upper bound for the total restrained domination number of graphs
The metric dimension of the lexicographic product of graphs
On the locating chromatic number of Kneser graphs
On b-coloring of Kneser graphs
Constructing regular graphs with smallest defining number
Local coloring of the Kneser graphs
Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria
Chromatic equivalence classes of certain generalized polygon trees III
Chromatic equivalence classes of certain cycles with edges
On Vertex-Coloring 2-Edge-Weighting of Graphs
Locating Chromatic Number of Graphs
The Incidence Chromatic Number of Graphs with Maximum Degree Four
On the Total Restrained Domination Number

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 36
  • Page 37
  • Page 38
  • Page 39
  • Page 40
  • Page 41
  • Page 42
  • Page 43
  • Page 44
  • …
  • Next page ››
  • Last page Last »
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

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