Best approximation on graphs
*Zainab Flaih HassanCorresponding authorzainab.flaih@ec.edu.iqGeneral Directorate of Education, Ministry of EducationNajaf, Iraq0000-0001-7254-6668View full profile → , Hayder Jasim Yousifhayderjasim36@gmail.comGeneral Directorate of Education of Al-Qadisiyah, Ministry of EducationAl-Qadisiyah, Iraq0000-0002-0065-8393View full profile → , Jolan Lazim Dheyabjolan.alkfaje121@gmail.comGeneral Directorate of Education, Ministry of EducationBabylon, IraqView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 10 Dec 2024
- Published Online:
- 26 Jun 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2143
- Pages:
- 1195–1199
Abstract
Keywords
Subject Classifications
References
[1] K. G. Steffens. The history of approximation theory. birkhȁuser (2006).
[2] F.R. K. Chung and S-T. Yau, Eigenvalues of graphs and Sobolev inequalities, Combinatorics, Probability and Computing, vol. 4, pp. 11-25 (1995).
[3] F. R. K Chung, Spectral graph theory, Providence, R.I. and AMS (1997).
[4] Y.Bartal, N. Linial, M. Mendel, and A. Naor, On metric Ramsey-type phenomena, The thirty annals ACM symposium on Theory of computing, pp. 463-472, New York (2003).
[5] N. Linial, A. Magen, and A. Naor, Girth and Eucliden distortion, Geometric and Functional Analysis, vol 12, no. 2, pp. 380-394 (2002).
[6] J. Matous ̌ek, On embedding expanders into l_p spaces, Israel Journal Mathematics, vol 102, no. 1, pp. 198-197 (1997).
[7] M. I. Ostrovskii, Sobolev spaces on graphs, Questions Mathematicae, vol. 28, no. 4, pp. 501-523 (2005).
