Results 41 to 50 of about 2,084 (327)
Template-Driven Rainbow Coloring of Proper Interval Graphs
, 2021 For efficient design of parallel algorithms on multiprocessor architectures with memory banks, simultaneous access to a specified subgraph of a graph data structure by multiple processors requires that the data items belonging to the subgraph reside in ...
Sajith Padinhatteeri +9 more
core +1 more source
Rainbow connection number of amalgamation of some graphs
AKCE International Journal of Graphs and Combinatorics, 2016 Let G be a nontrivial connected graph. For k∈N, we define a coloring c:E(G)→{1,2,…,k} of the edges of G such that adjacent edges can be colored the same. A path P in G is a rainbow path if no two edges of P are colored the same. A rainbow path connecting
D. Fitriani, A.N.M. Salman
doaj +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
Rainbow Path and Color Degree in Edge Colored Graphs [PDF]
The Electronic Journal of Combinatorics, 2014 Let $G$ be an edge colored graph. A rainbow pathin $G$ is a path in which all the edges are colored with distinct colors. Let $d^c(v)$ be the color degree of a vertex $v$ in $G$, i.e. the number of distinct colors present on the edges incident on the vertex $v$. Let $t$ be the maximum length of a rainbow path in $G$.
Anita Das 0001 +2 more
openaire +3 more sources
An updated survey on rainbow connections of graphs - a dynamic survey
Theory and Applications of Graphs, 2017 The concept of rainbow connection was introduced by Chartrand, Johns, McKeon and Zhang in 2008. Nowadays it has become a new and active subject in graph theory. There is a book on this topic by Li and Sun in 2012, and a survey paper by Li, Shi and Sun in
Xueliang Li, Yuefang Sun
doaj +1 more source
Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six
Journal of Applied Mathematics, 2019 A rainbow t-coloring of a t-connected graph G is an edge coloring such that for any two distinct vertices u and v of G there are at least t internally vertex-disjoint rainbow (u,v)-paths.
J. Cervantes-Ojeda +3 more
doaj +1 more source
BATAS ATAS RAINBOW CONNECTION NUMBER PADA GRAF BUCKMINSTERFULLERENE
Jurnal Matematika UNAND, 2022 Misalkan G adalah suatu graf terhubung tak trivial. 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.
Fitri - Anggalia +2 more
doaj +1 more source
Online Rainbow Coloring In Graphs
CoRR, 2019 9 pages, 1 figure, Appeared in Proceeding of International Conference on Discrete Mathematics and its Applications to Network Science(ICDMANS-2018)
Debasis Dwibedy +2 more
openaire +2 more sources
Rainbow Matching in Edge-Colored Graphs [PDF]
The Electronic Journal of Combinatorics, 2010 A rainbow subgraph of an edge-colored graph is a subgraph whose edges have distinct colors. The color degree of a vertex $v$ is the number of different colors on edges incident to $v$. Wang and Li conjectured that for $k\geq 4$, every edge-colored graph with minimum color degree at least $k$ contains a rainbow matching of size at least $\left\lceil k/
Timothy D. LeSaulnier +3 more
openaire +2 more sources
Rainbow Matchings in Properly-Colored Hypergraphs [PDF]
The Electronic Journal of Combinatorics, 2019 A hypergraph $H$ is properly colored if for every vertex $v\in V(H)$, all the edges incident to $v$ have distinct colors. In this paper, we show that if $H_{1}, \ldots, H_{s}$ are properly-colored $k$-uniform hypergraphs on $n$ vertices, where $n\geq3k^{2}s$, and $e(H_{i})>{{n}\choose {k}}-{{n-s+1}\choose {k}}$, then there exists a rainbow matching
Hao Huang, Tong Li, Guanghui Wang 0002
openaire +3 more sources