Coxeter theory investigates groups generated by reflections and the geometric structures arising from their actions, such as root systems and Dynkin diagrams. This body of work underpins vast areas of ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

Kolla’s research interests include spectral graph theory, algorithms, complexity, convex programming, statistical physics and quantum computing. Kolla is particularly interested in the use of spectral ...

Graph labeling is a central topic in combinatorial optimisation that involves assigning numerical or categorical labels to vertices or edges of a graph subject to specific constraints. This framework ...

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

Taiwanese Journal of Mathematics, Vol. 6, No. 3 (September 2002), pp. 415-420 (6 pages) In a graph G, a vertex is said to dominate itself and all of its neighbors. For a fixed positive integer k, the ...

I'm learning a little about graph theory and got sidetracked into Powershell text formatting. I'm writing a script that creates a two-dimensional array based on user input and displays the array in a ...

One course in optimization (including primal, dual problems, Lagrangian functions), linear algebra, calculus, familiar with real analysis or permission of instructor. Large-scale networks and datasets ...