Best approximation on graphs

In this paper we define best approximation on graphs when p≥1. The great Russian mathematician P.L. Chebyshev developed approximation theory. Here we study the best on graphs and the problem of uniqueness approximation.

Authors

Publication Details

Journal
Journal of Discrete Mathematical Sciences and Cryptography
Published
2025-01-01
DOI
https://doi.org/10.47974/jdmsc-2143
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Best approximation on graphs

Hayder J. Yousif, Zainab flaih Hassan, Jolan Lazim Dheyab
Journal of Discrete Mathematical Sciences and Cryptography
Limits and Structures in Graph Theory
article

Best approximation on graphs

Hayder J. Yousif, Zainab flaih Hassan, Jolan Lazim Dheyab
article en

Abstract

In this paper we define best approximation on graphs when p≥1. The great Russian mathematician P.L. Chebyshev developed approximation theory. Here we study the best on graphs and the problem of uniqueness approximation.

Journal of Discrete Mathematical Sciences and CryptographyVol. 28(4-A)
Openalex Percentile: Top 79%
Limits and Structures in Graph Theory
DOISourceOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Best approximation on graphs — Hayder J. Yousif, Zainab flaih Hassan, et al. · Journal of Discrete Mathematical Sciences and Cryptography (2025) | TGRS Research Map | TGRS