Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Simanjuntak Rinovia"'
Publikováno v:
E3S Web of Conferences, Vol 501, p 02004 (2024)
The Graph Neural Network (GNN) is an advanced use of graph theory that is used to address complex network problems. The application of Graph Neural Networks allows the development of a network by the modification of weights associated with the vertic
Externí odkaz:
https://doaj.org/article/b34a90b2eb224ed38374841356c75375
In 2019, Perondi and Carmelo determined the set multipartite Ramsey number of particular complete bipartite graphs by establishing a relationship between the set multipartite Ramsey number, Hadamard matrices, and strongly regular graphs, which is a b
Externí odkaz:
http://arxiv.org/abs/2307.09736
Autor:
Hafidh, Yusuf, Kurniawan, Rizki, Saputro, Suhadi, Simanjuntak, Rinovia, Tanujaya, Steven, Uttunggadewa, Saladin
Let $G$ be a connected graph and $W$ be a set of vertices of $G$. The representation multiset of a vertex $v$ with respect to $W$, $r_m (v|W)$, is defined as a multiset of distances between $v$ and the vertices in $W$. If $r_m (u |W) \neq r_m(v|W)$ f
Externí odkaz:
http://arxiv.org/abs/1908.05879
For a set of distances $D$, a graph $G$ of order $n$ is said to be $D-$magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots, n\}$ and a constant $k$ such that for any vertex $x$, $\sum_{y\in N_D(x)} f(y) =k$, where $N_D(x)=\{y|d(y,x)=j, j\
Externí odkaz:
http://arxiv.org/abs/1903.05005
Autor:
Simanjuntak, Rinovia, Anuwiksa, Palton
For a set of distances $D$, a graph $G$ on $n$ vertices is said to be $D$-magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots , n\}$ and a constant $k$ such that for any vertex $x$, $\sum_{y\in N_D(x)} f(y) = k$, where $N_D(x)=\{y|d(x,y)=
Externí odkaz:
http://arxiv.org/abs/1903.04459
Publikováno v:
In Heliyon November 2022 8(11)
A graph $G$ is said to be distance magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots , v\}$ and a constant {\sf k} such that for any vertex $x$, $\sum_{y\in N(x)} f(y) ={\sf k}$, where $N_(x)$ is the set of all neighbours of $x$. In thi
Externí odkaz:
http://arxiv.org/abs/1712.04879
We introduce a variation of metric dimension, called the multiset dimension. The representation multiset of a vertex $v$ with respect to $W$ (which is a subset of the vertex set of a graph $G$), $r_m (v|W)$, is defined as a multiset of distances betw
Externí odkaz:
http://arxiv.org/abs/1711.00225
Autor:
Barragan-Ramirez, Gabriel A., Simanjuntak, Rinovia, Saputro, Suhadi W., Uttunggadewa, Saladin
A vertex $v$ is said to distinguish two other vertices $x$ and $y$ of a nontrivial connected graph G if the distance from $v$ to $x$ is different from the distance from $v$ to $y$. A set $S\subseteq V(G)$ is a local metric set for $G$ if every two ad
Externí odkaz:
http://arxiv.org/abs/1512.07420
Publikováno v:
AIMS Mathematics; 2024, Vol. 9 Issue 8, p21177-21188, 12p