L. Markenzon

activity

20192026

collaborators

Showing math.COShow all

3 papers · 1 filter

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…

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…

math.CO2020

Toughness and Hamiltonicity in Random Apollonian Networks

Lilian Markenzon, Christina F. E. M. Waga

In this paper we study the toughness of Random Apollonian Networks (RANs), a random graph model which generates planar graphs with power-law properties. We consider their important…