As a branch of graph theory, Graph drawing applies topology and geometry to derive two- and three-dimensional representations of graphs. Graph drawing is motivated by applications such as VLSI circuit ...

Power graphs provide an innovative way to visualise and analyse the algebraic structure of finite groups. In a power graph, the elements of a finite group serve as vertices, and an edge is drawn ...

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 ...

Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...

On March 15, intriguing seminar announcements sent rumblings through the field of combinatorics, the mathematical study of counting. Three collaborators planned to give coordinated talks the following ...

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 ...

In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

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 ...

A signed bipartite graph G(U,V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident ...