Zobrazeno 1 - 10
of 68
pro vyhledávání: '"P, Susanth"'
A dominating set $D_{f}\subseteq V(G)$ of vertices in a graph $G$ is called a \emph{dom-forcing set} if the sub-graph induced by $\langle D_{f} \rangle$ must form a zero forcing set. The minimum cardinality of such a set is known as the dom-forcing n
Externí odkaz:
http://arxiv.org/abs/2411.00580
Autor:
Thomas Kannampallil, Olusola A. Ajilore, Nan Lv, Joshua M. Smyth, Nancy E. Wittels, Corina R. Ronneberg, Vikas Kumar, Lan Xiao, Susanth Dosala, Amruta Barve, Aifeng Zhang, Kevin C. Tan, Kevin P. Cao, Charmi R. Patel, Ben S. Gerber, Jillian A. Johnson, Emily A. Kringle, Jun Ma
Publikováno v:
Translational Psychiatry, Vol 13, Iss 1, Pp 1-8 (2023)
Abstract Consumer-based voice assistants have the ability to deliver evidence-based treatment, but their therapeutic potential is largely unknown. In a pilot trial of a virtual voice-based coach, Lumen, delivering problem-solving treatment, adults wi
Externí odkaz:
https://doaj.org/article/d8e59a6ff82c4503b4ab3630c523dfd3
Publikováno v:
Contemporary Studies in Discrete Mathematics, Vol. 1, No. 1, 2017, pp. 21-30
The curling number of a graph G is defined as the number of times an element in the degree sequence of G appears the maximum. Graph colouring is an assignment of colours, labels or weights to the vertices or edges of a graph. A colouring $\mathcal{C}
Externí odkaz:
http://arxiv.org/abs/1804.01860
Publikováno v:
Advances in Agriculture, Vol 2023 (2023)
In order to feed the growing population, agriculture is a vital component of any country; however, pests pose a constant threat to it. Chemical pesticides are employed to safeguard the crops from the enormous yield loss. These chemical pesticides are
Externí odkaz:
https://doaj.org/article/fea398717a0d49d68e316e1cd62779bc
Given a finite nonempty sequence $S$ of integers, write it as $XY^k$, consisting of a prefix $X$ (which may possibly be empty), followed by $k$ copies of a non-empty string $Y$. Then, the greatest such integer $k$ is called the curling number of $S$
Externí odkaz:
http://arxiv.org/abs/1512.01096
Publikováno v:
Metabolites, Vol 13, Iss 8, p 890 (2023)
In recent years, high-throughput technologies have facilitated the widespread use of metabolomics to identify biomarkers and targets for oral squamous cell carcinoma (OSCC). As a result, the primary goal of this systematic review is to identify and e
Externí odkaz:
https://doaj.org/article/edd3a2e15ef4405da63f764c3a3dc707
Autor:
Thomas Kannampallil, Olusola A. Ajilore, Nan Lv, Joshua M. Smyth, Nancy E. Wittels, Corina R. Ronneberg, Vikas Kumar, Lan Xiao, Susanth Dosala, Amruta Barve, Aifeng Zhang, Kevin C. Tan, Kevin P. Cao, Charmi R. Patel, Ben S. Gerber, Jillian A. Johnson, Emily A. Kringle, Jun Ma
Publikováno v:
Translational Psychiatry, Vol 13, Iss 1, Pp 1-1 (2023)
Externí odkaz:
https://doaj.org/article/7ed2c906797d497a980f7f7dfd649b2d
Let $S=S_1S_2S_3\ldots S_n$ be a finite string. Write $S$ in the form $XYY\ldots Y=XY^k$, consisting of a prefix $X$ (which may be empty), followed by $k$ copies of a non-empty string $Y$. Then, the greatest value of this integer $k$ is called the cu
Externí odkaz:
http://arxiv.org/abs/1510.01271
Given a finite nonempty sequence $S$ of integers, write it as $XY^k$, where $Y^k$ is a power of greatest exponent that is a suffix of $S$: this $k$ is the curling number of $S$. The concept of curling number of sequences has already been extended to
Externí odkaz:
http://arxiv.org/abs/1509.00220
We introduce the concept of a family of finite directed graphs (\emph{positive integer order,} $f(x) = mx + c; x,m \in \Bbb N$ and $c \in \Bbb N_0)$ which are directed graphs derived from an infinite directed graph called the $f(x)$-root digraph. The
Externí odkaz:
http://arxiv.org/abs/1506.06538