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

Finding Contents or People

An upper bound for the total restrained domination number of graphs
Answer To Challenging Problems
Characterization of n-vertex graphs with metric‎‎ dimension n-3
Local clique covering of graphs
On the locating chromatic number of Kneser graphs
The metric dimension of the lexicographic product of graphs
Characterization of a Class of Hamiltonian Connected Graphs
On the defining sets of some special graphs
On Vertex-Coloring 2-Edge-Weighting of Graphs
Chromatic Classes of Certain 2-Connected Graphs
Edge clique covering sum of graphs
Star Edge Coloring of Cactus Graphs
Some lower bounds for the L-intersection number of graphs
Topological indices of nanotubes and rooted product of graphs
Topological indices of some nanotubes and composite graphs

Pagination

  • First page « First
  • Previous page ‹‹
  • Page 1
  • Page 2
  • Page 3
  • Page 4
  • Page 5
  • Page 6
  • Page 7
  • Page 8
  • Page 9
  • …
  • 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

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