Results 41 to 50 of about 9,667,141 (66)
Rainbow Connection Number of Special Graph and Its Operations [PDF]
, 2014 Let $G$ be a simple graph. An edge-coloring of a graph $G$ is rainbow connected if, for any two vertices of $G$, there are $k$ internally vertex-disjoint paths joining them, each of which is rainbow and then a minimal numbers of color $G$ is required to ...
Nastiti, Artanty, Dafik, Dafik
core
On the rainbow vertex connection number of general unicyclic graphs
In a graph G, the distance between any two vertices is defined as the length of the shortest path connecting them. A path in G is termed rainbow vertex-connected if all internal vertices along the path have distinct colors.
Alfarisi, Ridho +2 more
core +1 more source
Graph theory and cryptography maintain a profound theoretical relationship, especially concerning structural complexity and computational diculty. This paper investigates a new intersection by utilizing Rainbow Antimagic Edge Coloring on Flower Snark ...
Sunil S. +4 more
core +1 more source
Rainbow Connection Number of Prism and Product of Two Graphs [PDF]
, 2014 An edge-colouring of a graph $G$ is rainbow connected if, for any two vertices of $G$, there are $k$ internally vertex-disjoint paths joining them, each of which is rainbow and then a minimal numbers of color $G$ is required to make rainbow connected ...
Darmawan, Randhi N., Dafik, Dafik
core
ANALISA RAINBOW CONNECTION DAN STRONG RAINBOW CONNECTION PADA GRAF HASIL OPERASI
, 2016 Salah satu teori yang dikembangkan dalam teori graf adalah rainbow connection dan strong rainbow connection. Rainbow connection adalah pemberian warna pada sisi graf dengan syarat dua sisi yang bertetangga boleh diberi warna yang sama. Namun sisi yang
Hasan, Mokhamad Saiful
core
Pewarnaan Lokal Wilayah Super Antimagic Pada Graf Planar
, 2018 Konsep pewarnaan graf puncaknya muncul pada tahun 1976, yaitu sebagai hasil dari pemecahan persoalan 4 warna. Setelahnya muncul konsep pelabelan graf.
RATRI, Arum Andary
core
Strong Rainbow Connection in Digraphs
, 2018 International audienceAn arc-coloured digraph is strongly rainbow connected if for every pair of vertices (u, v) there exists a shortest path from u to v all of whose arcs have different colours.
Sidorowicz, Elzbieta, Sopena, Eric
core