A simple graph is said to be reflexive if the second largest eigenvalue of its (0, 1)-adjacency matrix does not exceed 2. Based on some recent results on reflexive graphs with more cycles and some new ...

Graph irregularity and labelling techniques are central in discrete mathematics, offering profound insights into the intrinsic properties of complex networks. These methods involve assigning numerical ...

It is shown that nonreflexive Banach spaces with a separable dual and the boundedly complete skipped blocking property have quasi-reflexive subspaces. In particular, Bourgain's somewhat reflexive ...