IPM Positions

Non Resident Researcher (non-resident), School of Mathematics (2002 - 2003 )

Past IPM Positions

Associate Researcher (non-resident), School of Mathematics (1996 - 2002)

Research Interests

Graph Theory, Category Theory, General System Theory, Cryptography, Computer Science

Research Activities

In this project we continue the study of possible applications of the theory of random walks in graph theory, with a focus on graph coloring. Specially, we consider the following possible approaches. Possible extensions of Daneshgar-Hajiabolhassan method in graph homeomorphisms []. ? Possible extensions of counting methods through Markov chains. ? Possible extensions of potential theoretic methods in graph theory with a focus on their relationships to the base graph. ? ? References [] A.?Daneshgar and H.?Hajiabolhassan, Random walks and graph homeomorphisms, in Proceedings of DIMACS, J.?Nesetril and P.?Winkler, eds., Rutgers University, AMS Publ. Co., 2001. (To appear).

Present Research Project at IPM

Random Walks on Graphs

Related Papers

1.	A. Daneshgar and H. Hajiabolhassan Unique list-colourability and the fixing chromatic number of graphs Discrete Appl. Math. 152 (2005), 123-138  [abstract]

2.	A. Daneshgar and H. Hajiabolhassan Random walks and graph homomorphisms DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 63 (2004), 49-63  [abstract]

3.	A. Daneshgar and H. Hajiabolhassan Graph homomorphisms through random walks J. Graph Theory 44 (2003), 15-38  [abstract]

4.	A. Daneshgar and R. Naserasr On some parameters related to uniquely vertex-colorable graphs and defining sets Ars Combin. 69 (2003), 301-318  [abstract]

5.	A. Daneshgar Forcing structures and cliques in uniquely vertex colorable graphs SIAM J. Discrete Math. 14 (2001), 433-445  [abstract]

6.	P. D. Johnson Jr., A. J. W. Hilton and A. Daneshgar Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs Discrete Math. 241 (2001), 189-199  [abstract]

7.	A. Daneshgar and R. Naserasr On small uniquely vertex-colourable graphs and Xu's conjecture Discrete Math. 223 (2000), 93-108  [abstract]

8.	A. Daneshgar On r-type-constructions and ∆-colour-critical graphs J. Combin. Math. Combin. Comput. 29 (1999), 183-206  [abstract]

9.	A. Daneshgar Residuated semigroups and morphological aspects of translation invariant systems Fuzzy Sets and Systems 90 (1997), 69-81  [abstract]

10.	A. Daneshgar Thresholding in a generalized model for translation invariant systems Fuzzy Sets and Systems 85 (1997), 391-395  [abstract]

11.	A. Daneshgar Duality in a generalized model for translation invariant systems Fuzzy Sets and Systems 83 (1996), 347-352  [abstract]

12.	A. Daneshgar Reconstruction in a generalized model for translation invariant systems Fuzzy Sets and Systems 83 (1996), 51-55  [abstract]