Results 81 to 90 of about 274,074 (298)

The strong rainbow vertex-connection of graphs [PDF]

, 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
Li, Xueliang, Mao, Yaping, Shi, Yongtang
core  

The rainbow connection number of graph resulting for operation of sun graph and path graph

, 2020
Let G is a connected graph. A rainbow k-coloring on G is a function c : E(G) → {1, …, k for k ∈ ℕ where for any two vertices u and v in V, there is a path which all edges have no same color.
N. M. Surbakti, D. R. Silaban, K. Sugeng
semanticscholar   +1 more source

Listening to Hong Kong children's perspectives through pretend play

British Educational Research Journal, EarlyView.
Abstract Quality in early childhood education and care (ECEC) has become an increasing concern in recent years. The issue has been regularly discussed by different stakeholders. However, the rising concern regarding quality in ECEC has not seriously taken into account children's perspectives.
Suzannie K. Y. Leung
wiley   +1 more source

PENENTUAN RAINBOW CONNECTION NUMBER UNTUK AMALGAMASI GRAF LENGKAP DENGAN GRAF RODA

Jurnal Matematika UNAND, 2019
Suatu pewarnaan terhadap sisi-sisi di graf G terhubung tak trivial didefinisikan sebagai c : E(G) → {1, 2, · · · , k} untuk k ∈ N adalah suatu pewarnaan terhadap sisi-sisi di G sedemikian sehingga setiap sisi yang bertetangga boleh diberi warna yang sama.
Risya Hazani Utari, Lyra Yulianti, Syafrizal Sy   +2 more
doaj   +1 more source

On (strong) proper vertex-connection of graphs

, 2015
A path in a vertex-colored graph is a {\it vertex-proper path} if any two internal adjacent vertices differ in color. A vertex-colored graph is {\it proper vertex $k$-connected} if any two vertices of the graph are connected by $k$ disjoint vertex-proper
Jiang, Hui, Li, Xueliang, Zhang, Yingying, Zhao, Yan   +3 more
core   +1 more source

The spread of non‐native species

Biological Reviews, EarlyView.
ABSTRACT The global redistribution of species through human agency is one of the defining ecological signatures of the Anthropocene, with biological invasions reshaping biodiversity patterns, ecosystem processes and services, and species interactions globally.
Phillip J. Haubrock, Ali Serhan Tarkan, Irene Martín‐Forés, Stelios Katsanevakis, Ronaldo Sousa, Ismael Soto, Andy J. Green, Antonín Kouba, Teun Everts, Victoria Dominguez Almela, Nadège Belouard, Cang Hui, Jamie Bojko, Victor Deklerck, Margaux Boeraeve, Franz Essl, J. Robert Britton   +16 more
wiley   +1 more source

The impacts of biological invasions

Biological Reviews, EarlyView.
ABSTRACT The Anthropocene is characterised by a continuous human‐mediated reshuffling of the distributions of species globally. Both intentional and unintentional introductions have resulted in numerous species being translocated beyond their native ranges, often leading to their establishment and subsequent spread – a process referred to as biological
Phillip J. Haubrock, Teun Everts, Neil Angelo S. Abreo, Jamie Bojko, Victor Deklerck, James W. E. Dickey, Ana Clara S. Franco, Emili García‐Berthou, Stelios Katsanevakis, Natalia I. Kirichenko, Stefano Mammola, Martin A. Nuñez, Ben Parker, Riccardo Scalera, Ismael Soto, Diederik Strubbe, Ali Serhan Tarkan, Lorenzo Vilizzi, Tim Adriaens, Paride Balzani, Dagmara Błońska, Elizabeta Briski, Rein Brys, Amy L. Burgess, James E. Byers, Carlos Cano‐Barbacil, Giuseppe Castaldelli, Jaimie T.A. Dick, Victoria Dominguez Almela, Romina D. Dimarco, Margarita Florencio, Antonín Kouba, Melina Kourantidou, Irmak Kurtul, Irene Martín‐Forés, Olivier Morissette, Julian D. Olden, Bruno E. Soares, Jakub Truszkowski, Hugo Verreycken, Marc Kenis, Ronaldo Sousa, J. Robert Britton   +42 more
wiley   +1 more source

Algorithms and Bounds for Very Strong Rainbow Coloring

, 2018
A well-studied coloring problem is to assign colors to the edges of a graph $G$ so that, for every pair of vertices, all edges of at least one shortest path between them receive different colors.
Algorithms and Complexity, Bender, Michael A., Chandran, L. Sunil, Das, Anita, Farach-Colton, Martin, Issac, Davis, Leeuwen, Erik Jan van, Mosteiro, Miguel A., Sub Algorithms and Complexity   +8 more
core   +1 more source

The Rainbow Connection Number of Triangular Snake Graphs

Anais do Encontro de Teoria da Computação (ETC 2020), 2020
Rainbow coloring problems, of noteworthy applications in Information Security, have been receiving much attention last years in Combinatorics. The rainbow connection number of a graph G is the least number of colors for a (not necessarily proper) edge ...
Aleffer Rocha, S. M. Almeida, L. Zatesko
semanticscholar   +1 more source

Expression of mutant TIE2 p.L914F during mouse development causes embryonic lethality and defects in vascular remodeling

Developmental Dynamics, EarlyView.
Abstract Background Sporadic venous malformation (VM) is associated with the hyperactivating p.L914F mutation in TIE2, a receptor tyrosine kinase essential for vascular development. This mutation is not found in hereditary VM, suggesting incompatibility with life when expressed during early vascular development.
Lindsay J. Bischoff, Sandra Schrenk, Kara Soroko, Chhiring Sherpa, Ashok Arasu, Damien Reynaud, Elisa Boscolo   +6 more
wiley   +1 more source