Articles

type: Conference
Title	Date
مجموعه هاي مكان نماي فاصله اي	1383-11
On the defining numbers of cartesian product of cycles	1382-04
Chromatic Classes of Certain 2-Connected Graphs	1381-06
chromaticity of generalized polygon trees	1379-04
A new bound for defining number of regular graphs	1378-12

type: Journal
Title	DOI	Date
تابع مولد	#	1382-08
Chromatic Equivalence Classes of Certain Generalized Polygon Trees II	#	1381-01
Chromatic equivalence classes of certain generalized polygon trees III	#	1381-01
Chromatic equivalence classes of certain cycles with edges	#	1379-01

type:
Title	Date
2-Trees with Metric Dimension Two	-
An Enforced Hill Climbing Based System for General Game Playing	-
An upper bound for the total restrained domination number of graphs	-
Chromatic Classes of Certain 2-Connected Graphs	-
Chromatic equivalence classes of certain generalized polygon trees II	-
Metric Dimension of Graphs	-
Max-min total restrained domination number	-
Distance Locating Sets in Graphs	-
Personalized Privacy Preserving Method for Social Networks Graph k-Anonymization	-
Smallest defining number of r-regular k-chromatic graphs: r≠k. Ars Combinatoria	-
Edge clique covering sum of graphs	-