L. Markenzon

activity

20192026

collaborators

7 papers

math.CO2026

Characterizing graphs with the second largest distance eigenvalue less than -1/2

Miriam Abdón, Lilian Markenzon, Cybele T. M. Vinagre

Let $G$ be a connected graph with vertex set $V$ . The distance, $d_{G} (u, v)$ , between vertices $u$ and $v$ of $G$ is defined as the length of a shortest path between $u$ and $v$ in…

cs.DM2025

Structural and Spectral Properties of Strictly Interval Graphs

Claudia Justel, Lilian Markenzon

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…

math.CO2023

Exploring structural properties of $k$ -trees and block graphs

Lilian Markenzon, Allana S. S. Oliveira, Cybele T. M. Vinagre

We present a new characterization of $k$ -trees based on their reduced clique graphs and $(k + 1)$ -line graphs, which are block graphs. We explore structural properties of these two c…

math.CO2021

Linear time determination of the scattering number for strictly chordal graphs

Lilian Markenzon, Christina F. E. M. Waga

The scattering number of a graph $G$ was defined by Jung in 1978 as $sc (G) = ma x {ω (G - S) - ∣ S ∣, S \subseteq V, ω (G - S) \neq = 1}$ where $ω (G - S)$ is the number of connected com…

cs.DM2020

Integer Laplacian eigenvalues of strictly chordal graphs

Nair Abreu, Claudia Marcela Justel, Lilian Markenzon

In this paper, we establish the relation between classic invariants of graphs and their integer Laplacian eigenvalues, focusing on a subclass of chordal graphs, the strictly chorda…

math.CO2020

Toughness and Hamiltonicity in Random Apollonian Networks