3 papers
cs.SI2022
On the epidemic threshold of a network
V. Cherniavskyi, G. Dennis, S. R. Kingan
The graph invariant examined in this paper is the largest eigenvalue of the adjacency matrix of a graph. Previous work demonstrates the tight relationship between this invariant, t…
math.CO2021
Constructing minimally 3-connected graphs
J. P. Costalonga, R. J. Kingan, S. R. Kingan
A -connected graph is minimally 3-connected if removal of any edge destroys 3-connectivity. We present an algorithm for constructing minimally 3-connected graphs based on the re…
math.CO2019
A characterization of 2-neighborhood degree list of diameter 2 graphs
N. Benakli, E. Halleck, S. R. Kingan
Let denote the set of degrees of vertices at distance 2 from . The -neighborhood degree list of a graph is a listing of for every vertex . A degree r…