Zobrazeno 1 - 10
of 351
pro vyhledávání: '"Shook, James"'
Autor:
Shook, James M.
Two simple $n$-vertex graphs $G_{1}$ and $G_{2}$, with respective maximum degrees $\Delta_{1}$ and $\Delta_{2}$, are said to pack if $G_{1}$ is isomorphic to a subgraph of the complement of $G_{2}$. The BEC conjecture by Bollob\'{a}s, Eldridge, and C
Externí odkaz:
http://arxiv.org/abs/2308.13130
Autor:
Shook, James M, Wei, Bing
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 vertices $x$ and $y$, denoted by $d_{G}(x,y)$, is the length of a sho
Externí odkaz:
http://arxiv.org/abs/2210.00039
Autor:
Shook, James M.
In 1974, Kundu showed that for even $n$ if $\pi=(d_{1},\ldots,d_{n})$ is a non-increasing degree sequence such that $\mathcal{D}_{k}(\pi)=(d_{1}-k,\ldots,d_{n}-k)$ is graphic, then some realization of $\pi$ has a $k$-factor. In 1978, Brualdi and then
Externí odkaz:
http://arxiv.org/abs/2205.01645
Autor:
Shook, James M.
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 non-increasing degree sequence $\pi=(d_{1},\ldots,d_{n})$, Jack Edmonds showed that there is
Externí odkaz:
http://arxiv.org/abs/2204.04299
Identity management systems (IDMSs) are widely used to provision user identities while managing authentication, authorization, and data sharing within organizations and on the web. Traditional identity systems typically suffer from single points of f
Externí odkaz:
http://arxiv.org/abs/1908.00929
Federated identity management enables users to access multiple systems using a single login credential. However, to achieve this a complex privacy compromising authentication has to occur between the user, relying party (RP) (e.g., a business), and a
Externí odkaz:
http://arxiv.org/abs/1906.11057
Most modern electronic devices can produce a random number. However, it is difficult to see how a group of mutually distrusting entities can have confidence in any such hardware-produced stream of random numbers, since the producer could control the
Externí odkaz:
http://arxiv.org/abs/1906.11011
Autor:
Shook, James M.1 (AUTHOR) james.shook@nist.gov
Publikováno v:
Journal of Graph Theory. Oct2024, p1. 29p. 2 Illustrations.
Publikováno v:
In Ceramics International 1 December 2020 46(17):26777-26783
Publikováno v:
In Solid State Sciences February 2019 88:48-56