Loading...
  1. Simple search
  2. Search result
Search for: mahmoodian--e--s
0.105 seconds
Total 13168 records
 List View    Gallery View

# Type Title Author Publisher Pub. Year Subjects Call Number
1 مقاله Possible volumes of t-(v, T + 1) Latin trades Mahmoodian, E. S. Charles Babbage Research Centre, 2013 Latin bitrade.
Spectrum.
T-latin trade.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
2 مقاله Coloring the square of products of cycles and paths Mahmoodian, E. S. 2011 Cylinders and tori.
Distance coloring.
Graph G.
Grids.
Sharp bounds.
Vertex set.
Cylinders (shapes)
Coloring.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
3 مقاله On minimum vertex covers of generalized petersen graphs Behsaz, B. 2008 Domination number.
Paired-domination.
Critical graph.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
4 مقاله On the size of the minimum critical set of a Latin square Ghandehari, M. 2005 Combinatorial mathematics.
Matrix algebra.
Number theory.
Probability.
Theorem proving.
Conjectures.
Critical sets.
Latin squares.
Partial Latin squares.
Set theory.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
5 مقاله On the spectrum of the forced matching number of graphs Afshani, P. 2004
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
6 مقاله On the forced matching numbers of bipartite graphs Adams, P. 2004 Forcing number.
Hypercubes.
Matching in graphs.
Unique matchings.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
7 مقاله On the possible volumes of μ-way latin trades Adams, P. Birkhauser Verlag Basel, 2002 Intersection.
Latin rectangle.
Latin square.
Trade.
Volume of trade.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
8 مقاله The three-way intersection problem for latin squares Adams, P. 2002
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
9 مقاله A linear algebraic approach to orthogonal arrays and Latin squares Khanban, A. A. 2012 Basis for inclusion matrix.
Latin squares.
Latin trades.
Orthogonal arrays.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
10 مقاله On the existence of 3 -way k-homogeneous Latin trades Bagheri Gh., B. 2012 μ-way k-homogeneous Latin trade.
μ-way Latin trade.
Latin square.
Latin trade.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
11 مقاله On the defining sets of some special graphs Mahmoodian, E. S. 2006
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
12 مقاله Silver Block Intersection Graphs of Steiner 2-Designs Ahadi, A. 2013 Block intersection graph.
Silver coloring.
Steiner 2-design.
Steiner triple system.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
13 مقاله On the chromatic number of Latin square graphs Besharati, N. Elsevier 2016 Cayley table.
Coloring.
Latin square.
Latin square graphs.
Net graphs.
Orthogonal array.
Orthogonal mate.
Partial transversal.
Transversal.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
14 مقاله The square chromatic number of the torus Goodarzvand Chegini, A. Elsevier 2016 2-distance colouring.
Cartesian product.
Torus.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
15 مقاله Silver cubes Ghebleh, M. 2008 Silver matrix.
Graph colouring.
Coding theory.
Domination in graphs.
Finite projective geometry.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
16 مقاله A linear algebraic approach to directed designs Mahmoodian, E. S. 2001
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
17 مقاله Vertex domination of generalized Petersen graphs Javad Ebrahimi, B. 2009 Cardinality.
Dominating sets.
Domination numbers.
Edge-sets.
Efficient dominating sets.
Efficient domination.
Generalized Petersen graph.
Graph g.
Minimum dominating sets.
Natural numbers.
Odd numbers.
Perfect domination.
Sufficient conditions.
Vertex domination.
Vertex sets.
Graph theory.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
18 مقاله Smallest defining number of r-regular k-chromatic graphs: R ≠ k Mahmoodian, E. S. 2006
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
19 مقاله On uniquely k-list colorable planar graphs, graphs on surfaces, and regular graphs Abdolmaleki, M. Springer Tokyo, 2018 Graphs on surfaces.
Planar graphs.
Regular graphs.
Uniquely list colorable graphs.
$stringUtil.getCallnumberViewFormat($resource.getCallNumber())
20 پایان نامه چند روش کاهش گراف و کاربرد آن ها در مونتاژ موازی ژن Graph Reductions and its Application in Parallel Gene Assembly آزادی، محمد Azadi, Mohammad صنعتی شریف 1391 موازی کاری Parallelism / کاهش گراف Graph Reduction / پیچیدگی موازی Parallel Complexity / مونتاژ ژن Gene Assembly
‭02-43467
Total 13168 records