Results 61 to 70 of about 5,179 (208)
Color code techniques in rainbow connection
Electronic Journal of Graph Theory and Applications, 2018 Let G be a graph with an edge k-coloring γ : E(G) → {1, …, k} (not necessarily proper). A path is called a rainbow path if all of its edges have different colors.
Fendy Septyanto, Kiki A. Sugeng
doaj +1 more source
Rainbow connection number of generalized composition
AKCE International Journal of Graphs and Combinatorics, 2020 Let be a connected graph with . The rainbow connection number is the smallest for which there is a map such that any two vertices can be connected by a path whose edge colors are all distinct.
Fendy Septyanto, Kiki Ariyanti Sugeng
doaj +1 more source
Proteins: Structure, Function, and Bioinformatics, EarlyView.ABSTRACT Artificial protein design enables the creation of stable scaffolds beyond those evolved in nature. Incorporation of native functional motifs into de novo scaffolds provides a promising strategy to mimic natural interactions while altering structural frameworks.
Hakuto Miyoshi +7 more
wiley +1 more source
Rapid Communications in Mass Spectrometry, EarlyView.ABSTRACT Rationale Ions trapped within a Penning cell (ICR) travel periodic orbits whose frequencies are dependent on their mass‐to‐charge ratio and the value of the magnetic field passing through the trap. Fourier transformation (FT‐ICR) decomposes the signal induced in the detection circuit by the rotation of the ions in the cell after the ...
Patrick Arpino, Michel Heninger
wiley +1 more source
On the Rainbow Vertex-Connection
Discussiones Mathematicae Graph Theory, 2013 A vertex-colored graph is rainbow vertex-connected if any two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection of a connected graph G, denoted by rvc(G), is the smallest number of colors that ...
Li Xueliang, Shi Yongtang
doaj +1 more source
How Tough a Passage? Nonnative Fish Entrainment Survivability at a Major Dam in the Western USA
River Research and Applications, EarlyView.ABSTRACT The Colorado River downstream of Glen Canyon Dam (GCD) in the southwest USA demonstrates anthropogenic modification including altered flow and temperature regimes and established nonnative species in upstream reservoirs. Water overallocation and megadrought are contributing to new potential invasion pathways for nonnative fishes through dam ...
Barrett Friesen +2 more
wiley +1 more source
On the rainbow connection numbers of line, middle, and total graphs of wheels
Electronic Journal of Graph Theory and ApplicationsAn edge-colored graph G is called rainbow connected if any two vertices in G are connected by a path whose no two edges are colored the same. The rainbow connection of G, denoted by rc(G), is the smallest number of colors needed such that G be a rainbow ...
Lyra Yulianti +2 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2018 A total-colored graph G is rainbow total-connected if any two vertices of G are connected by a path whose edges and internal vertices have distinct colors.
Sun Yuefang, Jin Zemin, Tu Jianhua
doaj +1 more source
Sustainable Development, EarlyView.ABSTRACT This study investigates stakeholder perspectives on mobilising private‐sector finance for climate adaptation in Southeast Asia, emphasising Hong Kong's role as a financial intermediary. Through semi‐structured interviews with diverse stakeholders, including practitioners, policymakers, insurers, and project developers, we employed a grounded ...
Laurence L. Delina +4 more
wiley +1 more source
Rainbow Connection Number of Dense Graphs
Discussiones Mathematicae Graph Theory, 2013 An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to ...
Li Xueliang +2 more
doaj +1 more source