Zobrazeno 1 - 10
of 320
pro vyhledávání: '"Mora, Mercè"'
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
Let $\mathcal{F}$ be a set of graphs. A set $D$ of vertices of a graph $G$ is $\mathcal{F}$-isolating if the graph obtained by removing from $G$ all the vertices in $D$ and their neighbors does not have a copy of a graph in $\mathcal{F}$ as a subgrap
Externí odkaz:
http://arxiv.org/abs/2408.14653
Autor:
Mora, Mercè, Tey, Joaquín
Let $G=(V,E)$ be a simple graph of size $m$ and $L$ a set of $m$ distinct real numbers. An $L$-labeling of $G$ is a bijection $\phi: E \rightarrow L$. We say that $\phi$ is an antimagic $L$-labeling if the induced vertex sum $\phi_+: V \rightarrow \m
Externí odkaz:
http://arxiv.org/abs/2405.05375
Publikováno v:
Discrete Mat. 347 (2024) 113903
A set $D$ of vertices of a graph $G$ is isolating if the set of vertices not in $D$ or with no neighbor in $D$ is independent. The isolation number of $G$, denoted by $\iota (G)$, is the minimum cardinality of an isolating set of $G$. It is known tha
Externí odkaz:
http://arxiv.org/abs/2307.11520
Publikováno v:
Mediterr. J. Math (2022) 19:188
An ordered set $S$ of vertices of a graph $G$ is a resolving set for $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of G is the minimum cardinality of a resolving set. In this paper
Externí odkaz:
http://arxiv.org/abs/2112.08768
Publikováno v:
In Discrete Mathematics May 2024 347(5)
Publikováno v:
J. Stat. Mech. (2020) 083401
Many real transportation and mobility networks have their vertices placed on the surface of the Earth. In such embeddings, the edges laid on that surface may cross. In his pioneering research, Moon analyzed the distribution of the number of crossings
Externí odkaz:
http://arxiv.org/abs/2003.03353
Publikováno v:
Discuss. Math. Graph T. 42 (2022) 959-966
An antimagic labeling a connected graph $G$ is a bijection from the set of edges $E(G)$ to $\{1,2,\dots,|E(G)|\}$ such that all vertex sums are pairwise distinct, where the vertex sum at vertex $v$ is the sum of the labels assigned to edges incident
Externí odkaz:
http://arxiv.org/abs/1905.06595
Autor:
Claverol, Mercè, García, Alfredo, Hernández, Greogorio, Hernando, Carmen, Maureso, Montserrat, Mora, Mercè, Tejel, Javier
Publikováno v:
Bull. Malays. Math. Sci. Soc. (2021) 44:2603-2630
In this paper, we study the metric dimension problem in maximal outerplanar graphs. Concretely, if $\beta (G)$ is the metric dimension of a maximal outerplanar graph $G$ of order $n$, we prove that $2\le \beta (G) \le \lceil \frac{2n}{5}\rceil$ and t
Externí odkaz:
http://arxiv.org/abs/1903.11933
Publikováno v:
Discuss. Math. Graph T. 43 (2023) 659-675
A $k$-coloring of a graph $G$ is a partition of the set of vertices of $G$ into $k$ independent sets, which are called colors. A $k$-coloring is neighbor-locating if any two vertices belonging to the same color can be distinguished from each other by
Externí odkaz:
http://arxiv.org/abs/1903.11937