Results 131 to 140 of about 7,406 (155)
Some of the next articles are maybe not open access.
Rainbow vertex connection number of square, glue, middle and splitting graph of brush graph
AIP Conference Proceedings, 2020A vertex-colored graph G = (V(G), E(G)) is said a rainbow vertex-connected, if for every two vertices u and v in V(G), there exist a u−v path with all internal vertices have distinct colors.
H. Helmi +3 more
semanticscholar +2 more sources
Rainbow vertex-connection number of 2-connected graphs
Applied Mathematical Sciences, 2011 The {\em rainbow vertex-connection number}, $rvc(G)$, of a connected graph $G$ is the minimum number of colors needed to color its vertices such that every pair of vertices is connected by at least one path whose internal vertices have distinct colors ...
Xueliang Li, Sujuan Liu
semanticscholar +4 more sources
Journal of Interconnection Networks
The proper rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed to properly color the vertices of [Formula: see text] to make [Formula: see text] rainbow vertex connected.
Yingbin Ma, Yanfeng Xue, Xiaoxue Zhang
semanticscholar +2 more sources
The proper rainbow vertex connection number of [Formula: see text], denoted by [Formula: see text], is the smallest number of colors needed to properly color the vertices of [Formula: see text] to make [Formula: see text] rainbow vertex connected.
Yingbin Ma, Yanfeng Xue, Xiaoxue Zhang
semanticscholar +2 more sources
International Journal of Research and Innovation in Applied Science
The Rainbow Vertex Connection Number of a graph is the minimum number of colors required to make a graph rainbow vertex connected. A graph is said to be a rainbow vertex connected if there exists a rainbow vertex path between every pair of distinct ...
V. Jothika, P. Mythili
semanticscholar +2 more sources
The Rainbow Vertex Connection Number of a graph is the minimum number of colors required to make a graph rainbow vertex connected. A graph is said to be a rainbow vertex connected if there exists a rainbow vertex path between every pair of distinct ...
V. Jothika, P. Mythili
semanticscholar +2 more sources
Rainbow Vertex Connection Number of a Class of Triangular Snake Graph
, 2020Dharamvirsinh Parmar, B. Suthar
semanticscholar +2 more sources
Strong rainbow vertex-connection number of comb product of a path and a connected graph
AIP Conference ProceedingsZ. Awanis +2 more
semanticscholar +2 more sources
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 +5 more
semanticscholar +1 more source
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 +5 more
semanticscholar +1 more source
On rainbow vertex anti-magic coloring of amalgamation graphs
Journal of Discrete Mathematical Sciences and CryptographyA rainbow vertex anti-magic coloring represents a relatively new area of exploration in graph theory. This concept extends the idea of rainbow vertex coloring by incorporating elements of anti-magic labeling.
R. Alfarisi +3 more
semanticscholar +1 more source
On Rainbow Vertex Antimagic Coloring of Related Prism Graphs and Its Operations
Statistics, Optimization & Information ComputingLet $G=(V,E)$ be a simple, connected and un-directed graph, for $f:E(G)\rightarrow\{1,2,\dots, |E(G)|\}$, the weight of a vertex $v\in V(G)$ under $f$ is $w_f(v)=\Sigma_{e \in E(v)} f(e)$, where $E(v)$ is the set of vertices incident to $v$. The function
R. Prihandini +5 more
semanticscholar +1 more source
Rainbow vertex k-connection in graphs
Discrete Applied Mathematics, 2013Angela Mestre, TERESA Sousa
exaly