Zobrazeno 1 - 10
of 2 216
pro vyhledávání: '"05c12"'
Publikováno v:
Artificial Intelligence in Medicine, 2024
Patients who are undergoing physical rehabilitation, benefit from feedback that follows from reliable assessment of their cumulative performance attained at a given time. In this paper, we provide a method for the learning of the recovery trajectory
Externí odkaz:
http://arxiv.org/abs/2410.21983
A set of n non-collinear points in the Euclidean plane defines at least n different lines. Chen and Chv\'tal in 2008 conjectured that the same results is true in metric spaces for an adequate definition of line. More recently, it was conjectured in 2
Externí odkaz:
http://arxiv.org/abs/2410.21433
In this paper, we consider the monoids of all partial endomorphisms, of all partial weak endomorphisms, of all injective partial endomorphisms, of all partial strong endomorphisms and of all partial strong weak endomorphisms of a star graph with a fi
Externí odkaz:
http://arxiv.org/abs/2410.21084
Autor:
Ali, Usman, Hussain, Iffat Fida
We define an independence system associated with simple graphs. We prove that the independence system is a matroid for certain families of graphs, including trees, with bases as minimal resolving sets. Consequently, the greedy algorithm on the matroi
Externí odkaz:
http://arxiv.org/abs/2410.15356
For a positive integer $g$, we study a family of plane graphs $G$ without cycles of length less than $g$ that are maximal in a sense that adding any new edge to $G$ either makes it non-plane or creates a cycle of length less than $g$. We show that th
Externí odkaz:
http://arxiv.org/abs/2410.13481
Autor:
Balamoorthy, S., Kavaskar, T.
Let $\varepsilon(G)$ be the eccentricity matrix of a graph $G$ and $Spec(\varepsilon(G))$ be the eccentricity spectrum of $G$. Let $H[G_1,G_2,\ldots, G_k]$ be the $H$-join of graphs $G_1,G_2,\ldots, G_k$ and let $H[G]$ be lexicographic product of $H$
Externí odkaz:
http://arxiv.org/abs/2410.13382
Autor:
Mora, Mercè, Puertas, María Luz
Publikováno v:
Bull. Malays. Math. Sci. Soc. (2023) 46:187
The metric representation of a vertex $u$ in a connected graph $G$ respect to an ordered vertex subset $W=\{\omega_1, \dots , \omega_n\}\subset V(G)$ is the vector of distances $r(u\vert W)=(d(u,\omega_1), \dots , d(u,\omega_n))$. A vertex subset $W$
Externí odkaz:
http://arxiv.org/abs/2410.10411
The metric dimension of a graph measures how uniquely vertices may be identified using a set of landmark vertices. This concept is frequently used in the study of network architecture, location-based problems and communication. Given a graph $G$, the
Externí odkaz:
http://arxiv.org/abs/2410.08662
A set of vertices S is a resolving set of a graph G; if for every pair of vertices x and y in G, there exists a vertex s in S such that x and y differ in distance to s. A smallest resolving set of G is called a metric basis. The metric dimension dim(
Externí odkaz:
http://arxiv.org/abs/2410.03656
A $(1,1,2,2)$-coloring of a graph is a partition of its vertex set into four sets two of which are independent and the other two are $2$-packings. In this paper, we prove that every claw-free cubic graph admits a $(1,1,2,2)$-coloring. This implies th
Externí odkaz:
http://arxiv.org/abs/2409.15455