The following pages link to Amir Daneshgar (Q424498):
Displaying 24 items.
- (Q221617) (redirect page) (← links)
- On cylindrical graph construction and its applications (Q252833) (← links)
- On nodal domains and higher-order Cheeger inequalities of finite reversible Markov processes (Q424499) (← links)
- On the complexity of isoperimetric problems on trees (Q765346) (← links)
- Graph homomorphisms and nodal domains (Q852625) (← links)
- On defining numbers of circular complete graphs (Q864158) (← links)
- Clustering and outlier detection using isoperimetric number of trees (Q898224) (← links)
- Density and power graphs in graph homomorphism problem (Q932664) (← links)
- On the isoperimetric spectrum of graphs and its approximations (Q974467) (← links)
- Thresholding in a generalized model for translation invariant systems (Q1267543) (← links)
- Residuated semigroups and morphological aspects of translation invariant systems (Q1282894) (← links)
- Reconstruction in a generalized model for translation invariant systems (Q1367514) (← links)
- Duality in a generalized model for translation invariant systems (Q1368189) (← links)
- On small uniquely vertex-colourable graphs and Xu's conjecture (Q1587598) (← links)
- A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra (Q1618225) (← links)
- Strong continuous non-malleable encoding schemes with tamper-detection (Q2195381) (← links)
- On the odd girth and the circular chromatic number of generalized Petersen graphs (Q2359794) (← links)
- Circular colouring and algebraic no-homomorphism theorems (Q2372443) (← links)
- Unique list-colourability and the fixing chromatic number of graphs (Q2576344) (← links)
- Mean isoperimetry with control on outliers: exact and approximation algorithms (Q2672637) (← links)
- Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs (Q2753535) (← links)
- Function simulation, graph grammars and colourings (Q2855758) (← links)
- (Q3070347) (← links)
- (Q3115020) (← links)
