Results 71 to 80 of about 156 (148)

Rainbow connection number of corona product of graphs

open access: yesElectronic Journal of Graph Theory and Applications
In an edge-colored graph (where adjacent edges may have the same color), a rainbow path is a path whose edge colors are all distinct. The coloring is called a rainbow coloring if any two vertices can be connected by a rainbow path. The rainbow connection
Fendy Septyanto
doaj   +1 more source

Note on vertex disjoint rainbow triangles in edge-colored graphs

open access: yes
Given an edge-colored graph $G$, we denote the number of colors as $c(G)$, and the number of edges as $e(G)$. An edge-colored graph is rainbow if no two edges share the same color. A proper $mK_3$ is a vertex disjoint union of $m$ rainbow triangles. Rainbow problems have been studied extensively in the context of anti-Ramsey theory, and more recently ...
Kritschgau, Jürgen   +3 more
openaire   +2 more sources

A Robust Algorithm for Asymmetric Cryptography Using Rainbow Vertex Antimagic Coloring

open access: yesStatistics, Optimization & Information Computing
Cryptography plays a crucial role in securing information and communications in the face of advancing technologies. Asymmetric encryption, also known as public-key cryptography, plays a crucial role in cryptography. Unlike symmetric encryption, which uses a single key for both encryption and decryption, asymmetric encryption involves a pair of keys ...
Kiswara Agung Santoso   +5 more
openaire   +1 more source

Bounds and complexity results of rainbow vertex-disconnection colorings

open access: yesAIMS Mathematics
A subset $ Y\subseteq V(G) $ in a vertex-colored graph $ G $ is termed rainbow when vertices in $ Y $ receive distinct colors from each other. For each pair of vertices $ w_1, w_2\in V(G) $, if there exists $ \mathcal{F}\subseteq V(G) $ satisfying $ \mathcal{F} $ rainbow and $ w_1, w_2 $ disconnected in $ G-\mathcal{F} $ for nonadjacent $ w_1, w_2 $; $
openaire   +2 more sources

Monochromatic Graph Decompositions Inspired by Anti-Ramsey Theory and Parity Constraints

open access: yesMathematics
We open here many new tracks of research in anti-Ramsey Theory, considering edge-coloring problems inspired by rainbow coloring and further by odd colorings and conflict-free colorings. Let G be a graph and F any given family of graphs. For every integer
Yair Caro, Zsolt Tuza
doaj   +1 more source

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

open access: yesAlgorithms Mol Biol, 2023
Schaller D   +5 more
europepmc   +1 more source

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

open access: yesStatistics, 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 different weight $w(x)$, where $w(x) = \Sigma_{xx' \in E(G)}f(xx')$. The least number of colors used among
null Dafik   +5 more
openaire   +1 more source

Analysis on COVID-19 Infection Spread Rate during Relief Schemes Using Graph Theory and Deep Learning. [PDF]

open access: yesComput Math Methods Med, 2022
Palanivinayagam A   +5 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy