The search for integral cographs is a topic of interest in Spectral Graph Theory. From this, and motivated by the structural characteristics of these graphs, and by their spectral properties, we propose, in this dissertation, ...

Given a simple graph G, a set (Formula presented.) is a neighborhood cover set if every edge and vertex of G belongs to some G[v] with (Formula presented.), where G[v] denotes the subgraph of G induced by the closed ...

A graph is probe (unit) interval if its vertices can be partitioned into two sets: a set of probe vertices and a set of nonprobe vertices, so that the set of nonprobe vertices is a stable set and it is possible to obtain ...

Given a simple graph G, a set C subset of V(G)\documentclass[12pt] is a neighborhood cover set if every edge and vertex of G belongs to some G[v] with v is an element of C\documentclass[12pt] denotes the subgraph of G ...

Given a simple graph G, a set C subset of V(G)\documentclass[12pt] is a neighborhood cover set if every edge and vertex of G belongs to some G[v] with v is an element of C\documentclass[12pt] denotes the subgraph of G ...