Zobrazeno 1 - 10
of 72
pro vyhledávání: '"Kang, Cong X."'
The modular product $G\diamond H$ of graphs $G$ and $H$ is a graph on vertex set $V(G)\times V(H)$. Two vertices $(g,h)$ and $(g',h')$ of $G\diamond H$ are adjacent if $g=g'$ and $hh'\in E(H)$, or $gg'\in E(G)$ and $h=h'$, or $gg'\in E(G)$ and $hh'\i
Externí odkaz:
http://arxiv.org/abs/2402.07194
Let $G$ be a graph with vertex set $V$. A set $S \subseteq V$ is a \emph{strong resolving set} of $G$ if, for distinct $x,y\in V$, there exists $z\in S$ such that either $x$ lies on a $y-z$ geodesic or $y$ lies on an $x-z$ geodesic in $G$. In this pa
Externí odkaz:
http://arxiv.org/abs/2307.02373
Autor:
Kang, Cong X., Yi, Eunjeong
Let $d(x,y)$ denote the length of a shortest path between vertices $x$ and $y$ in a graph $G$ with vertex set $V$. For a positive integer $k$, let $d_k(x,y)=\min\{d(x,y), k+1\}$ and $R_k\{x,y\}=\{z\in V: d_k(x,z) \neq d_k(y,z)\}$. A set $S \subseteq
Externí odkaz:
http://arxiv.org/abs/2208.08371
Autor:
Kang, Cong X., Yi, Eunjeong
Publikováno v:
Bull. Inst. Combin. Appl., Vol. 95 (2022) pp.38-56
Let $G$ be a graph with vertex set $V$, and let $k$ be a positive integer. A set $D \subseteq V$ is a \emph{distance-$k$ dominating set} of $G$ if, for each vertex $u \in V-D$, there exists a vertex $w\in D$ such that $d(u,w) \le k$, where $d(u,w)$ i
Externí odkaz:
http://arxiv.org/abs/2106.14848
A subset $S$ of the vertices $V$ of a connected graph $G$ resolves $G$ if no two vertices of $V$ share the same list of distances (shortest-path metric) with respect to the vertices of $S$ listed in a given order. The choice of such an $S$ in $V$ amo
Externí odkaz:
http://arxiv.org/abs/2105.12773
A set of vertices $W$ of a graph $G$ is a resolving set if every vertex of $G$ is uniquely determined by its vector of distances to $W$. In this paper, the Maker-Breaker resolving game is introduced. The game is played on a graph $G$ by Resolver and
Externí odkaz:
http://arxiv.org/abs/2005.13242
We consider the action of the (combinatorial) Laplacian of a finite and simple graph on integer vectors. By a \emph{Laplacian monopole} we mean an image vector negative at exactly one coordinate associated with a vertex. We consider a numerical semig
Externí odkaz:
http://arxiv.org/abs/1910.05614
Publikováno v:
Theoret. Comput. Sci., Vol. 806 (2020) pp.53-69
The notion of metric dimension, $dim(G)$, of a graph $G$, as well as a number of variants, is now well studied. In this paper, we begin a local analysis of this notion by introducing $cdim_G(v)$, \emph{the connected metric dimension of $G$ at a verte
Externí odkaz:
http://arxiv.org/abs/1804.08147
Publikováno v:
Appl. Anal. Discrete Math., Vol. 13 (2019) pp. 203-223
Let $G$ be a graph with vertex set $V(G)$. For any two distinct vertices $x$ and $y$ of $G$, let $R\{x, y\}$ denote the set of vertices $z$ such that the distance from $x$ to $z$ is not equal to the distance from $y$ to $z$ in $G$. For a function $g$
Externí odkaz:
http://arxiv.org/abs/1706.05550
Publikováno v:
Acta Mathematica Sinica. Aug2023, Vol. 39 Issue 8, p1425-1441. 17p.
