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

Finding Contents or People

On b-coloring of cartesian product of graphs
The metric dimension of the lexicographic product of graphs
On randomly k-dimentional graphs
On the locating chromatic number of Kneser graphs
On b-coloring of Kneser graphs
Locally rainbow graphs
Constructing regular graphs with smallest defining number
Local coloring of the Kneser graphs
On the local colorings of graphs
On the defining sets of some special graphs
Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria
2-Trees with Metric Dimension Two
Some Graphs with Vertex-Coloring 2-Edge Weighting
On Vertex-Coloring 2-Edge-Weighting of Graphs
Randomly Dimensional Graphs

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 133
  • Page 134
  • Page 135
  • Page 136
  • Page 137
  • Page 138
  • Page 139
  • Page 140
  • Page 141
  • …
  • 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

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