Zobrazeno 1 - 10
of 463
pro vyhledávání: '"Sepanski, A."'
Autor:
Minyard, Mitchell, Sepanski, Mark R.
A graph is said to be neighborhood 3-balanced if there exists a vertex labeling with three colors so that each vertex has an equal number of neighbors of each color. We give order constraints on 3-balanced graphs, determine which generalized Petersen
Externí odkaz:
http://arxiv.org/abs/2410.05422
Autor:
Erickson, William Q., Herden, Daniel, Meddaugh, Jonathan, Sepanski, Mark R., Minyard, Mitchell, Rosengartner, Kyle
Given a finite simple graph $G$, let $\operatorname{M}(G)$ denote its 2-distance graph, in which two vertices are adjacent if and only if they have distance 2 in $G$. In this paper, we consider the periodic behavior of the sequence $G, \operatorname{
Externí odkaz:
http://arxiv.org/abs/2409.02306
A vertex coloring of a graph is said to be pseudocomplete if, for any two distinct colors, there exists at least one edge with those two colors as its end vertices. The pseudoachromatic number of a graph is the greatest number of colors possible used
Externí odkaz:
http://arxiv.org/abs/2408.16739
Autor:
Erickson, William Q., Herden, Daniel, Meddaugh, Jonathan, Sepanski, Mark R., Hammon, Cordell, Mohn, Jasmin, Ruiz-Bolanos, Indalecio
The tableau reconstruction problem, posed by Monks (2009), asks the following. Starting with a standard Young tableau $T$, a 1-minor of $T$ is a tableau obtained by first deleting any cell of $T$, and then performing jeu de taquin slides to fill the
Externí odkaz:
http://arxiv.org/abs/2307.13161
Autor:
CA Sepanski, DC Kalva
Publikováno v:
Hematology, Transfusion and Cell Therapy, Vol 46, Iss , Pp S160- (2024)
Introdução: A sepse é definida como uma síndrome clínica causada por uma resposta desregulada do hospedeiro frente a uma infecção, podendo levar à disfunção de múltiplos órgãos e óbito. O diagnóstico precoce e o manejo correto são con
Externí odkaz:
https://doaj.org/article/7d81249c12754ff0b063eb718d0c86d4
Autor:
Erickson, William Q., Herden, Daniel, Meddaugh, Jonathan, Sepanski, Mark R., Echols, Isaac, Hammon, Cordell, Marchena-Menendez, Jorge, Mohn, Jasmin, Radillo-Murguia, Blanca, Ruiz-Bolanos, Indalecio
For a graph $G$ and an abelian group $A$, a labeling of the vertices of $G$ induces a labeling of the edges via the sum of adjacent vertex labels. Hovey introduced the notion of an $A$-cordial vertex labeling when both the vertex and edge labels are
Externí odkaz:
http://arxiv.org/abs/2211.10044
Publikováno v:
AppliedMath, Vol 4, Iss 2, Pp 641-665 (2024)
We develop a framework for creating distortion functions that are used to construct new bivariate copulas. It is achieved by transforming non-negative random variables with Lomax-related distributions. In this paper, we apply the distortions to the b
Externí odkaz:
https://doaj.org/article/40e84b71b1ff4259adcf7834519e847e
Autor:
Erickson, William Q., Herden, Daniel, Meddaugh, Jonathan, Sepanski, Mark R., Hammon, Cordell, Mohn, Jasmin, Ruiz-Bolanos, Indalecio
Publikováno v:
In Journal of Combinatorial Theory, Series A January 2025 209
A monitor is a widely-used concurrent programming abstraction that encapsulates all shared state between threads. Monitors can be classified as being either implicit or explicit depending on the primitives they provide. Implicit monitors are much eas
Externí odkaz:
http://arxiv.org/abs/2203.00783
Autor:
Herden, Daniel, Meddaugh, Jonathan, Sepanski, Mark, Echols, Isaac, Garcia-Montoya, Nina, Hammon, Cordell, Huang, Guanjie, Kraus, Adam, Menendez, Jorge Marchena, Mohn, Jasmin, Jiménez, Rafael Morales
The vertex-edge marking game is played between two players on a graph, $G=(V,E)$, with one player marking vertices and the other marking edges. The players want to minimize/maximize, respectively, the number of marked edges incident to an unmarked ve
Externí odkaz:
http://arxiv.org/abs/2201.03633