The convex and strictly convex on graphs
The main goal of this paper introduces convex and strictly convex on graphs when 1 ≤ p < ∞. The convexity was discovered in ancient civilizations and developed in the over time by many scientists and researchers. Here we study the convex with discrete Sobolev seminorm of f and strictly convex on graphs with weighted Sobolev seminorm when 1 ≤ p < ∞.
Authors
- Karrar Taher R Aljamaly
- Zainab flaih Hassan
Publication Details
- Journal
- Journal of Interdisciplinary Mathematics
- Published
- 2025-01-01
- DOI
- https://doi.org/10.47974/jim-2193
- Primary Topic
- Advanced Graph Theory Research
- Type
- article
- Field-Weighted Citation Impact
- 0.00