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

Finding Contents or People

Topological indices of some nanotubes and composite graphs
On the locating chromatic number of the cartesian product of graphs
On incidence coloring for some graphs of maximum degree 4
Constructing regular graphs with smallest defining number
A New Bound for Defining Numbers of Regular Graphs
On the total restrained domination edge critical graphs
Some Graphs with Vertex-Coloring 2-Edge Weighting
ليست كنفرانس‌ها
Star Edge Coloring of Cartesian Product of Graphs
A Havel-Hakimi type problem for oriented graphs
The Incidence Chromatic Number of Graphs with Maximum Degree Four
Star coloring and tree-width of Kneser graph KG(n; 2)
Generalizations of Zero-Divisor Graph of Rings to Modules
On the simultaneous edge coloring of graphs
Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria

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

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