2024/11/16 by Bijo S. Anand, Arun Anil, Anand, Bijo S +7
Computer Science · Mathematics · #05C38 #05C69 #52A35 #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2411.10816
openalex publication_date 2024/11/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This article discusses Δ-convexity on simple connected graphs. We establish general bounds for the Helly number, Radon number, and rank with respect to Δ-convexity on graphs. Additionally, we give the exact values for the Helly number and Radon number for chordal graphs, as well as the rank for block graphs.