Results 71 to 80 of about 289,295 (264)

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  

ESG Decoupling Phenomenon: A Systematic and Bibliometric Analysis

Business Strategy and the Environment, EarlyView.
ABSTRACT ESG decoupling, defined as the gap between a firm's ESG disclosures and its actual practices, poses a critical challenge to corporate sustainability. Using the PRISMA protocol, 451 articles were selected for a comprehensive bibliometric and systematic literature review to map the intellectual structure and thematic evolution of the research on
Maryam Laeeq, Farida Akhtar, Han Lin Shang   +2 more
wiley   +1 more source

Rainbow connection in $3$-connected graphs [PDF]

, 2010
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 by $rc(G)$, is the smallest number of colors that are needed in ...
Li, Xueliang, Shi, Yongtang
core  

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

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

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

From Cell Line to Fillet: A Review of Biological and Engineering Strategies in Cultivated Seafood

Food Bioengineering, EarlyView.
Bottlenecks of the cultivated seafood industry are shown, and they prevent efficiency of key production stages. These include limited cell line availability, sustainable and cost‐effective media, adaption to suspension culture, sustainable cost‐effective and edible scaffolds, food regulatory approval and acceptance of genetic modified organisms (GMO ...
Angela Trace, Miriam Wankell, Craig McFarlane, Lionel Hebbard   +3 more
wiley   +1 more source

Exploring Belonging Through the Student Union: The Power of Familiar Faces and Comfortable Spaces

New Directions for Higher Education, EarlyView.
ABSTRACT Since their origin, college unions have played a significant role in fostering a sense of belonging and advancing the academic mission of colleges. However, published empirical studies remain scarce due to the focus of college union professionals’ work on both student development and facility operations.
Katheryn Paynter‐Fanning, Adriane Reilly   +1 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

RAINBOW CONNECTION NUMBER OF FLOWER SNARK GRAPH

, 2020
Let G be a nontrivial connected graph on which is defined a coloring c : E(G) → {1, 2, · · · , k}, k ∈ N of the edges of G, where adjacent edges may be colored the same. A path in G is called a rainbow path if no two edges of it are colored the same.
K. Rao, U. Kumar, A. Mekala
semanticscholar   +1 more source