Finding low-cost spanning subgraphs with given degree and connectivity requirements is a fundamental problem in the area of network design. We consider the problem of finding d-regular spanning subgraphs (or d-factors) of ...

O presente trabalho é uma introdução ao estudo de um grafo chamado Degree Graph. Este grafo é associado aos graus dos caracteres de um grupo nito no seguinte modo: os vértices são os primos que dividem os graus dos ...

We say that a graph is connected if there is a path edges between any pair of vertices. Random graph Erd os-R enyi with n vertices is obtained by connecting each pair of vertex with probability pn 2 (0; 1) independently ...

Let (Formula presented.) be an integral fusion category. We study some graphs, called the prime graph and the common divisor graph, related to the Frobenius-Perron dimensions of simple objects in the category (Formula ...

One of the main consequences of habitat loss and fragmentation is the increase in patch isolation and the consequent decrease in landscape connectivity. In this context, species persistence depends on their responses to ...

We consider two optimization problems in planar graphs. In Maximum Weight Independent Set of Objects we are given a graph G and a family D of objects, each being a connected subgraph of G with a prescribed weight, and the ...