Graph domination games represent a vibrant area of combinatorial game theory wherein two opponents engage in a strategic contest on the vertices of a graph. In the standard format, one player, known ...

Graph algorithms and combinatorial optimisation form a pivotal area of research that underpins many modern computational applications. At their core, graph algorithms provide systematic methods for ...

Feynman diagrams are an interesting intersection point between combinatorics and graph theory, algebra, as well as quantum field theory. They are graphs which label the perturbative expansion of ...

This is a preview. Log in through your library . Abstract The eigenvalues of the adjacency operator of a finite regular graph yield a great deal of information about the graph, including bounds on its ...