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 III #
Chromatic Equivalence Classes of Certain Generalized Polygon Trees II #
Chromatic equivalence classes of certain cycles with edges #
type:
Title Date
On the locating chromatic number of Kneser graphs -
On the oriented perfect path double cover conjecture -
Randomly Dimensional Graphs -
Clique-coloring of K3, 3-minor free graphs -
The metric dimension of the lexicographic product of graphs -
Star coloring and tree-width of Kneser graph KG(n; 2) -
Some Graphs with Vertex-Coloring 2-Edge Weighting -
Set Intersection Representations of Graphs -
The impact of network topology on delay bound in wireless Ad Hoc networks -
Chromaticity of Generalised Polygon Trees -
Chromatic equivalence classes of certain cycles with edges -