James Shook

Publications

On a conjecture that strengthens Kundu's k-factor Theorem

October 6, 2024

Author(s)

James Shook

Let π = (d1, . . . , dn) be a non-increasing degree sequence with even n. In 1974, Kundu showed that if Dk(π) = (d1 − k, . . . , dn − k) is graphic, then some

Maximally Edge-Connected Realizations and Kundu's k-factor Theorem

August 3, 2023

Author(s)

James Shook

A simple graph $G$ with edge-connectivity $\lambda(G)$ and minimum degree $\delta(G)$ is maximally edge connected if $\lambda(G)=\delta(G)$. In 1964, given a

A characterization of the Centers of Chordal Graphs

September 30, 2022

Author(s)

James Shook, Bing Wei

A graph is $k$-chordal if it does not have an induced cycle with length greater than $k$. We call a graph chordal if it is $3$-chordal. Let $G$ be a graph. The

A Taxonomic Approach to Understanding Emerging Blockchain Identity Management Systems

January 14, 2020

Author(s)

Loic D. Lesavre, Priam C. Varin, Peter M. Mell, Michael S. Davidson, James Shook

Identity management systems (IDMSs) are widely used to provision user identities while managing authentication, authorization, and data sharing within

Smart Contract Federated Identity Management without Third Party Authentication Services

March 28, 2019

Author(s)

Peter M. Mell, James F. Dray Jr., James Shook

Federated identity management enables users to access multiple systems using a single login credential. However, to achieve this a complex authentication has to

View more Publications

James Shook (Fed)

Mathematician

Publications

On a conjecture that strengthens Kundu's k-factor Theorem

Maximally Edge-Connected Realizations and Kundu's k-factor Theorem

A characterization of the Centers of Chordal Graphs

A Taxonomic Approach to Understanding Emerging Blockchain Identity Management Systems

Smart Contract Federated Identity Management without Third Party Authentication Services