Articles

type: Conference
Title Date
مجموعه هاي مكان نماي فاصله اي
On the defining numbers of cartesian product of cycles
Chromatic Classes of Certain 2-Connected Graphs
chromaticity of generalized polygon trees
A new bound for defining number of regular graphs
type: Journal
Title DOI Date
تابع مولد #
Chromatic Equivalence Classes of Certain Generalized Polygon Trees II #
Chromatic equivalence classes of certain generalized polygon trees III #
Chromatic equivalence classes of certain cycles with edges #
type:
Title Date
Fostering Peer Learning with a Game-Theoretical Approach in a Blended Learning Environment -
Critical Hamiltonian connected graphs -
Local Chromatic Number of Graphs -
On the defining sets of some special graphs -
Complexity reduction of throughput optimal link scheduling algorithm through topology control in wireless networks -
Star edge coloring of the Cartesian product of graphs -
On the locating chromatic number of the cartesian product of graphs -
On the Dominating Coloring -
Local coloring of the Kneser graphs -
An optimal traffic distribution method supporting end-to-end delay bound -
Characterization of randomly k-dimensional graphs -