James M. Shook

activity

20122025

most citedA Taxonomic Approach to Understanding Emerging Blockchain Identity Management Systems

56 citations · 83 across the 10 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

math.CO2022

a characterization of the centers of chordal graphs

James M 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 distance between the…

math.CO2022

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

James M. Shook

Let $π = (d_{1}, \dots, d_{n})$ be a non-increasing degree sequence with even $n$ . In 1974, Kundu showed that if $D_{k} (π) = (d_{1} - k, \dots, d_{n} - k)$ is graphic, then some re…

math.CO2022★ 2 cited

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

James M. Shook

A simple graph $G$ with edge-connectivity $λ (G)$ and minimum degree $δ (G)$ is maximally edge connected if $λ (G) = δ (G)$ . In 1964, given a non-increasing degree sequence $π=(d_{1},\ld…

a characterization of the centers of chordal graphs

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

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

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

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