Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

Evolutionary dynamics act on populations. Neither genes, nor cells, nor individuals evolve; only populations evolve. In small populations, random drift dominates, whereas large populations are ...

An interactive programming package called GRAPH, an expert system for graph theory, was developed at the University of Belgrade, Faculty of Electrical Engineering, during the period 1980-1984, GRAPH ...

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...

The visibility graph (VG) is a technique that acts as a bridge between dynamic systems and graph theory, and has been applied in recent years to analyze different systems in an innovative way. In this ...

In just three pages, a Russian mathematician has presented a better way to color certain types of networks than many experts thought possible. A paper posted online last month has disproved a ...