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

Finding Contents or People

Displaying 4701 - 4720 of 109666
4701 Locating Chromatic Number of Graphs Article
4702 Randomly Dimensional Graphs Article
4703 On Vertex-Coloring 2-Edge-Weighting of Graphs Article
4704 Some Graphs with Vertex-Coloring 2-Edge Weighting Article
4705 2-Trees with Metric Dimension Two Article
4706 Chromatic equivalence classes of certain cycles with edges Article
4707 Chromatic equivalence classes of certain generalized polygon trees II Article
4708 Chromatic equivalence classes of certain generalized polygon trees III Article
4709 Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria Article
4710 On the defining sets of some special graphs Article
4711 On the local colorings of graphs Article
4712 Local coloring of the Kneser graphs Article
4713 Constructing regular graphs with smallest defining number Article
4714 Locally rainbow graphs Article
4715 On b-coloring of Kneser graphs Article
4716 On construction of involutory MDS matrice from Vandermonde Matrices in GF(2q) Article
4717 On the locating chromatic number of Kneser graphs Article
4718 On randomly k-dimentional graphs Article
4719 The metric dimension of the lexicographic product of graphs Article
4720 On b-coloring of cartesian product of graphs Article

Pagination

  • First page « First
  • Previous page ‹‹
  • …
  • Page 232
  • Page 233
  • Page 234
  • Page 235
  • Page 236
  • Page 237
  • Page 238
  • Page 239
  • Page 240
  • …
  • 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

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