Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Bustan, Ariestha Widyastuty"'
A graph has a locating rainbow coloring if every pair of its vertices can be connected by a path passing through internal vertices with distinct colors and every vertex generates a unique rainbow code. The minimum number of colors needed for a graph
Externí odkaz:
http://arxiv.org/abs/2410.09304
The locating rainbow connection number of a graph is defined as the minimum number of colors required to color vertices such that every two vertices there exists a rainbow vertex path and every vertex has a distinct rainbow code. This rainbow code si
Externí odkaz:
http://arxiv.org/abs/2403.06004
Publikováno v:
MATEC Web of Conferences, Vol 372, p 04005 (2022)
The metric dimension of the connected graph G for each 𝑣 𝜖 𝑉(𝐺) to the set W is . The set r (ν|W) = (d(ν, w1), d(ν,w2),…d(ν,wk) W is called the resolving set if every vertex u,v in G, if u ≠ ν , then r (u|W) ≠ r (ν|W) . Then t
Externí odkaz:
https://doaj.org/article/f15b078528dd4a37b592169f9feb1a06
Publikováno v:
Jurnal THEOREMS (The Original Research of Mathematics); Vol 4, No 1 (2019)
Graph colouring using the Welch-Powell algorithm is one of the schedule preparation techniques. Especially for arranging student guidance schedules in a study program. The vertex on a graph is represented as a student who will conduct guidance, while
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=unmajalengka::9f2e5b83f706ae159865fbc29465470e
http://jurnal.unma.ac.id/index.php/th/article/view/1317
http://jurnal.unma.ac.id/index.php/th/article/view/1317
Publikováno v:
AIP Conference Proceedings; 2019, Vol. 2202 Issue 1, p020047-1-020047-6, 6p, 2 Diagrams, 4 Charts