2025/12/01 by Cláudia Marcela Justel, Claudia Justel, Markenzon, Lilian +2 · 1 voice
Computer Science · Mathematics · #05C50 #05C75 #Advanced Graph Theory Research #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #cs.DM #math.CO
paper · pdf · doi:10.48550/arxiv.2512.01175
openalex publication_date 2025/12/01 · arxiv published 2025/12/01 · openalex created_date 2025/12/03 · arxiv updated 2026/05/15 · openalex updated_date 2026/07/28
In this paper we deal with a subclass of chordal graphs, which are simultaneously strictly chordal and interval, the strictly interval graphs. We present a new characterization of the class that leads to a simple linear recognition algorithm. Next we introduce a new subclass of strictly interval graphs, the SI-core graphs, that are non-split and non-cograph graphs and show that several elements of the new class are Laplacian integral