Results 81 to 90 of about 9,765,356 (168)

Penentuan Rainbow Connection Number dan Strong Rainbow Connection Number pada Graf berlian. [PDF]

, 2017
Misalkan G = (V,E) adalah suatu graf. Suatu pewarnaan c : E(G) → {1,2,...,k}, k ∈ N pada graf G adalah suatu pewarnaan sisi di G sedemikian sehingga setiap sisi bertetangga boleh berwarna sama.
Suci, Riezsa Dessyluviani
core   +1 more source

Proper Rainbow Connection Number of Graphs

, 2021
A path in an edge-coloured graph is called a rainbow path if its edges receive pairwise distinct colours. An edge-coloured graph is said to be rainbow connected if any two distinct vertices of the graph are connected by a rainbow path.
Schiermeyer Ingo, Doan Trung Duy
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  

Graphs with rainbow connection number two [PDF]

, 2011
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order ...
Kemnitz, Arnfried, Schiermeyer, Ingo
core   +1 more source

On the Study of Rainbow Antimagic Connection Number of Comb Product of Friendship Graph and Tree

, 2022
Given a graph G with vertex set V(G) and edge set E(G), for the bijective function f(V(G))→{1,2,⋯,|V(G)|}, the associated weight of an edge xy∈E(G) under f is w(xy)=f(x)+f(y). If all edges have pairwise distinct weights, the function f is
Dafik Dafik, Veerabhadraiah Lokesha, Liliek Susilowati, Brian Juned Septory   +3 more
core   +1 more source

Crown reductions for the Minimum Weighted Vertex Cover problem [PDF]

, 2004
The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International ...
Chlebikova, Janka, Chlebík, Miroslav, Miroslav Chlebík, Chlebik, M., Miroslav Chlebik (4461319), Janka Chlebíková, Janka Chlebíková (16060964)   +6 more
core   +1 more source

Application of Rainbow Vertex Antimagic Coloring in Multi-Step Time Series Forecasting for Efficient Railway Passenger Load Management

Statistics, Optimization & Information Computing
Let $G$ be a simple graph and connected. If there is a bijection function $f:E(G)\to\{1,2,\cdots,|E(G)|\}$ and the rainbow vertex antimagic coloring is under the condition all internal vertices of a path $x-y$ for any two vertices $x$ and $y$ have ...
Dafik, E. Y. Kurniawati, I. H. Agustin, A. Kristiana, R. Adawiyah, M. Venkatachalam   +5 more
semanticscholar   +1 more source

The n-queens completion problem. [PDF]

Res Math Sci, 2022
Glock S, Munhá Correia D, Sudakov B.
europepmc   +1 more source

Relative timing information and orthology in evolutionary scenarios. [PDF]

Algorithms Mol Biol, 2023
Schaller D, Hartmann T, Lafond M, Stadler PF, Wieseke N, Hellmuth M.   +5 more
europepmc   +1 more source

Gallai-Ramsey and vertex proper connection numbers [PDF]

, 2015
Given a complete graph G, we consider two separate scenarios. First, we consider the minimum number N such that every coloring of G using exactly k colors contains either a rainbow triangle or a monochromatic star on t vertices.
Emily C. Chizmar, Chizmar, Emily C
core