Остановите войну!
for scientists:
default search action
Amir Daneshgar
- > Home > Persons > Amir Daneshgar
Publications
- 2019
- [j26]Amir Daneshgar, Ali Taherkhani:
A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra. Discret. Math. 342(1): 96-112 (2019) - 2013
- [j19]Amir Daneshgar, Alireza Rahimi, Siamak Taati:
Function simulation, graph grammars and colourings. Int. J. Comput. Math. 90(7): 1334-1357 (2013) - [j18]Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi:
Clustering and outlier detection using isoperimetric number of trees. Pattern Recognit. 46(12): 3371-3382 (2013) - 2012
- [j17]Amir Daneshgar, Ramin Javadi:
On the complexity of isoperimetric problems on trees. Discret. Appl. Math. 160(1-2): 116-131 (2012) - [i2]Amir Daneshgar, Ramin Javadi, Basir Shariat Razavi:
Clustering Using Isoperimetric Number of Trees. CoRR abs/1203.4204 (2012) - 2010
- [j16]Amir Daneshgar, Hossein Hajiabolhassan, Siamak Taati:
On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs. Ars Comb. 97 (2010) - [j15]Amir Daneshgar, Hossein Hajiabolhassan, Ramin Javadi:
On the isoperimetric spectrum of graphs and its approximations. J. Comb. Theory, Ser. B 100(4): 390-412 (2010) - [i1]Amir Daneshgar, Ramin Javadi:
On Complexity of Isoperimetric Problems on Trees. CoRR abs/1009.0706 (2010) - 2008
- [j14]Amir Daneshgar, Hossein Hajiabolhassan, Navid Hamedazimi:
On Connected Colourings of Graphs. Ars Comb. 89 (2008) - [j13]Amir Daneshgar, Hossein Hajiabolhassan:
Density and power graphs in graph homomorphism problem. Discret. Math. 308(17): 4027-4030 (2008) - 2007
- [j12]Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah:
On defining numbers of circular complete graphs. Discret. Math. 307(2): 173-180 (2007) - [j11]Amir Daneshgar, Hossein Hajiabolhassan:
Circular colouring and algebraic no-homomorphism theorems. Eur. J. Comb. 28(6): 1843-1853 (2007) - 2005
- [j10]Amir Daneshgar, Hossein Hajiabolhassan:
Unique list-colourability and the fixing chromatic number of graphs. Discret. Appl. Math. 152(1-3): 123-138 (2005) - 2003
- [j8]Amir Daneshgar, Hossein Hajiabolhassan:
Graph homomorphisms through random walks. J. Graph Theory 44(1): 15-38 (2003) - 2001
- [c1]Amir Daneshgar, Hossein Hajiabolhassan:
Random Walks and Graph Homomorphisms. Graphs, Morphisms and Statistical Physics 2001: 49-63
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 02:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint