Zobrazeno 1 - 10
of 71
pro vyhledávání: '"KAHL, NATHAN"'
Autor:
Kahl, Nathan, Luttrell, Kristi
Boesch, Li, and Suffel were the first to identify the existence of uniformly optimally reliable graphs (UOR graphs), graphs which maximize all-terminal reliability over all graphs with $n$ vertices and $m$ edges. The all-terminal reliability of a gra
Externí odkaz:
http://arxiv.org/abs/2410.01120
The independence polynomial of a graph $G$ evaluated at $-1$, denoted here as $I(G;-1)$, has arisen in a variety of different areas of mathematics and theoretical physics as an object of interest. Engstr\"om used discrete Morse theory to prove that $
Externí odkaz:
http://arxiv.org/abs/2409.14576
Autor:
Kahl, Nathan, Luttrell, Kristi
Publikováno v:
In Discrete Applied Mathematics 15 November 2023 339:78-88
Autor:
Kahl, Nathan
Publikováno v:
In Journal of Combinatorial Theory, Series B January 2022 152:121-152
Publikováno v:
ASEE Prism, 2016 Jul 01. 25(8), 42-58.
Externí odkaz:
https://www.jstor.org/stable/43774665
Publikováno v:
ASEE Prism, 2015 Sep 01. 25(1), 44-55.
Externí odkaz:
https://www.jstor.org/stable/43531194
Autor:
Cutler, Jonathan, Kahl, Nathan
The independence polynomial $I(G;x)$ of a graph $G$ is $I(G;x)=\sum_{k=1}^{\alpha(G)} s_k x^k$, where $s_k$ is the number of independent sets in $G$ of size $k$. The decycling number of a graph $G$, denoted $\phi(G)$, is the minimum size of a set $S\
Externí odkaz:
http://arxiv.org/abs/1410.7726
Publikováno v:
ASEE Prism, 2017 Jul 01. 26(8), 44-67.
Externí odkaz:
https://www.jstor.org/stable/26828805