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

Finding Contents or People

Characterization of randomly k-dimensional graphs
Unique basis graphs
Characterization of n-vertex graphs with metric‎‎ dimension n-3
Star coloring and tree-width of Kneser graph KG(n; 2)
Small oriented cycle double cover of graphs
On the simultaneous edge coloring of graphs
On the b-Coloring of Some Special Graphs
Local Chromatic Number of Graphs
Distance Locating Sets in Graphs
Chromatic Classes of Certain 2-Connected Graphs
A New Bound for Defining Numbers of Regular Graphs
Some lower bounds for the L-intersection number of graphs
Edge clique covering sum of graphs
Bike Share Station Location using Graph Domination Set in Graphs
Metric Dimension of Graphs

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 18
  • Page 19
  • Page 20
  • Page 21
  • Current page 22
  • Page 23
  • Page 24
  • Page 25
  • Page 26
  • …
  • 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

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