Philip Kains, Ph.D.
Dr. Kains is interested primarily in connectivity of graphs. The intersection of longest cycles in k-connected graphs has been studied extensively, with results having significant implications in cybersecurity. Dr. Kains’ research explores results of long cycles in k-connected graphs that are not necessarily longest in the graph overall. He is interested in path analogues for
Philip Kains, Ph.D. Read More »