Zobrazeno 1 - 10
of 191
pro vyhledávání: '"Jahanbekam, A."'
Autor:
Berikkyzy, Zhanar, Bjorkman, Beth, Blake, Heather Smith, Jahanbekam, Sogol, Keough, Lauren, Moss, Kevin, Rorabaugh, Danny, Shan, Songling
Let $G$ be a simple graph and $v$ be a vertex of $G$. The triangle-degree of $v$ in $G$ is the number of triangles that contain $v$. While every graph has at least two vertices with the same degree, there are graphs in which every vertex has a distin
Externí odkaz:
http://arxiv.org/abs/2308.10978
Publikováno v:
In Polymer Testing February 2024 131
Autor:
Crawford, Nicholas, Jahanbekam, Sogol
Let $G$ be an $n$-vertex graph and let $L:V(G)\rightarrow P(\{1,2,3\})$ be a list assignment over the vertices of $G$, where each vertex with list of size 3 and of degree at most 5 has at least three neighbors with lists of size 2. We can determine $
Externí odkaz:
http://arxiv.org/abs/2104.06547
Autor:
Jahanbekam, Sogol, Lin, Meng-Ru
Let $f$ be an optimal proper coloring of a graph $G$ and let $c$ be a coloring of the vertices of $G$ obtained by permuting the colors on vertices in the proper coloring $f$. The villainy of $c$, written $B(c)$, is the minimum number of vertices that
Externí odkaz:
http://arxiv.org/abs/2103.05816
Let $G$ be an $n$-vertex graph with the maximum degree $\Delta$ and the minimum degree $\delta$. We give algorithms with complexity $O(1.3158^{n-0.7~\Delta(G)})$ and $O(1.32^{n-0.73~\Delta(G)})$ that determines if $G$ is 3-colorable, when $\delta(G)\
Externí odkaz:
http://arxiv.org/abs/2008.12880
The \textit{$k$-weak-dynamic number} of a graph $G$ is the smallest number of colors we need to color the vertices of $G$ in such a way that each vertex $v$ of degree $d(v)$ sees at least $\rm{min}\{k,d(v)\}$ colors on its neighborhood. We use reduci
Externí odkaz:
http://arxiv.org/abs/1802.05953
The distinguishing number of a graph $G$, denoted $D(G)$, is the minimum number of colors needed to produce a coloring of the vertices of $G$ so that every nontrivial isomorphism interchanges vertices of different colors. A list assignment $L$ on a g
Externí odkaz:
http://arxiv.org/abs/1707.01823
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Amirhossein Jahanbekam, Jan Baumann, Robert D. Nass, Christian Bauckhage, Holger Hill, Christian E. Elger, Rainer Surges
Publikováno v:
Epilepsia Open, Vol 6, Iss 3, Pp 597-606 (2021)
Abstract Objective To identify non‐EEG‐based signals and algorithms for detection of motor and non‐motor seizures in people lying in bed during video‐EEG (VEEG) monitoring and to test whether these algorithms work in freely moving people duri
Externí odkaz:
https://doaj.org/article/b04828eebcd64801919423816563b2d0