4 papers · 1 filter
Characterizing graphs with the second largest distance eigenvalue less than -1/2
Miriam Abdón, Lilian Markenzon, Cybele T. M. Vinagre
Let be a connected graph with vertex set . The distance, , between vertices and of is defined as the length of a shortest path between and in…
Exploring structural properties of -trees and block graphs
Lilian Markenzon, Allana S. S. Oliveira, Cybele T. M. Vinagre
We present a new characterization of -trees based on their reduced clique graphs and -line graphs, which are block graphs. We explore structural properties of these two c…
Linear time determination of the scattering number for strictly chordal graphs
Lilian Markenzon, Christina F. E. M. Waga
The scattering number of a graph was defined by Jung in 1978 as where is the number of connected com…
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…