Results 21 to 30 of about 303 (159)
The Rainbow-Vertex Connection Number [RVCN] of Subdivision of Certain Graphs
International Journal of Scientific Research in Science, Engineering and Technology, 2022 Rainbow-Vertex Connection Number [rvcn] is computed for some graphs by the researchers. Here we have considered the subdivision graphs of certain graph classes. The rainbow edge connection number of subdivision of Triangular snake graph was already found[1].
null Dechamma K. K. +1 more
openaire +1 more source
Rainbow Vertex Connection Number pada Keluarga Graf Roda
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS, 2022 The rainbow vertex connection was first introduced by krivelevich and yuster in 2009 which is an extension of the rainbow connection. Let graph $G =(V,E)$ is a connected graph. Rainbow vertex-connection is the assignment of color to the vertices of a graph $G$, if every vertex on graph $G$ is connected by a path that has interior vertices with ...
Firman Firman +2 more
openaire +1 more source
Developing A Secure Cryptosystem with Rainbow Vertex Antimagic Coloring of Cycle Graph
, 2022 An edge labeling of graph G is a function g from the edge set of graph G to the first natural numbers up to the number of the edge set. Graph G admits a rainbow vertex antimagic coloring if, for any two vertices, there is a path with different colors of ...
Marsidi, Marsidi
core +1 more source
The strong rainbow vertex-connection of graphs
, 2012 A vertex-colored graph $G$ is said to be rainbow vertex-connected if every two vertices of $G$ are connected by a path whose internal vertices have distinct colors, such a path is called a rainbow path. The rainbow vertex-connection number of a connected graph $G$, denoted by $rvc(G)$, is the smallest number of colors that are needed in order to make ...
Li, Xueliang, Mao, Yaping, Shi, Yongtang
openaire +2 more sources
The rainbow vertex connection number of ladder graphs and Roach graphs
Ceylon Journal of Science, 2023 A vertex-coloured graph G is said to be rainbow vertex-connected, if every two vertices of G are connected by a path whose internal vertices have distinct colours. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colours that are needed to make G, a rainbow vertex-connected. This study focuses on
W. D. D. P. Dewananda +1 more
openaire +1 more source
Analisis rainbow vertex connection pada beberapa graf khusus dan operasinya
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS, 2021 The vertex colored graph G is said rainbow vertex cennected, if for every two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex connection number of G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex connected.
Ida Ariska +2 more
openaire +1 more source
Redefining Optimal Coverage Path Planning for FLS‐Equipped AUVs With Deep Reinforcement Learning
Journal of Field Robotics, EarlyView.ABSTRACT Autonomous Underwater Vehicles (AUVs) have emerged as indispensable tools for a variety of subsea tasks, from habitat monitoring and seabed mapping to infrastructure inspection and mine countermeasures. A fundamental challenge in this field is Coverage Path Planning (CPP), the problem of ensuring complete and efficient area coverage.
Lorenzo Cecchi +3 more
wiley +1 more source
On the Locating Rainbow Connection Number of Trees and Regular Bipartite Graphs [PDF]
, 2023 Locating the rainbow connection number of graphs is a new mathematical concept that combines the concepts of the rainbow vertex coloring and the partition dimension.
Putri, Pritta E. +7 more
core +1 more source
Journal of Fish Biology, EarlyView.Abstract A new species of Characidium is described from a small, isolated river in the highland areas of Noel Kempff Mercado National Park, Bolivia. The new taxon can be diagnosed by the presence of a relatively broad and conspicuous dark midlateral stripe extending from the tip of snout to the base of the caudal fin, markedly darker than the vertical ...
Leonardo Oliveira‐Silva +3 more
wiley +1 more source
An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth
Journal of Graph Theory, Volume 112, Issue 4, Page 409-420, August 2026.ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth. We improve on this by showing that graphs of cliquewidth k admit a partition with ‘local,
Marc Distel
wiley +1 more source