Results 21 to 30 of about 208 (119)
On the Rainbow Vertex-Connection
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
Rainbow connection number of amalgamation of some graphs
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
A Note on Extendable Sets of Colorings and Rooted Minors
ABSTRACT DeVos and Seymour proved that for every set C $C$ of 3‐colorings of a set X $X$ of vertices, there exists a plane graph G $G$ with vertices of X $X$ incident with the outer face such that a 3‐coloring of X $X$ extends to a 3‐coloring of G $G$ if and only if it belongs to C $C$.
Zdeněk Dvořák, Jan M. Swart
wiley +1 more source
Rainbow connection number of generalized composition
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
Simultaneous Network Design With Restricted Link Usage
ABSTRACT Given a digraph with two terminal vertices s$$ s $$ and t$$ t $$ as well as a conservative cost function and several not necessarily disjoint color classes on its arc set, our goal is to find a minimum‐cost subset of the arcs such that its intersection with each color class contains an s$$ s $$‐t$$ t $$ dipath.
Naonori Kakimura +3 more
wiley +1 more source
Generalized Rainbow Connection of Graphs and their Complements
Let G be an edge-colored connected graph. A path P in G is called ℓ-rainbow if each subpath of length at most ℓ + 1 is rainbow. The graph G is called (k, ℓ)-rainbow connected if there is an edge-coloring such that every pair of distinct vertices of G is ...
Li Xueliang +3 more
doaj +1 more source
ABSTRACT Pedicellariae are small appendages on the surface of the echinoid test, involved in defence, cleaning, and locomotion. Pedicellariae in three species of camarodont sea urchins common in UK waters (Paracentrotus lividus [Lamarck, 1816], Psammechinus miliaris [P.L.S Müller, 1771] and Echinus esculentus [Linnaeus, 1758]) are the focus of this ...
H. C. Reinardy +6 more
wiley +1 more source
THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS
Let be a nontrivial simple connected graph, be an edge of and be an integer greater than or equal to . A path of order , denoted by , is a graph whose vertices can be labelled such that .
Ratnaning Palupi, A. N. M. Salman
doaj +1 more source
Abstract The marronoid clade is a globally distributed, ecologically diverse group of spiders. It is an important faunal component in both natural and synanthropic environments, and even found in aquatic and extreme habitats such as desert salt flats. The systematics of the marronoid clade has been notoriously unstable due to the widespread character ...
Jonas O. Wolff +10 more
wiley +1 more source
Behavioural Diversity of Fishes: Concepts, Drivers and Its Role in Conservation and Management
ABSTRACT Human activity has altered nearly all ecosystems on Earth, contributing to substantial biodiversity loss across taxonomic, genetic and functional dimensions, from the intraspecific to the ecosystem scale. Yet some components of biodiversity remain hidden or underappreciated, including behavioural diversity.
Marie Prchalová +25 more
wiley +1 more source

