Results 61 to 70 of about 4,433 (166)
Local strong rainbow connection number of corona product between cycle graphs
Indonesian Journal of Combinatorics, 2023 A rainbow geodesic is a shortest path between two vertices where all edges are colored differently. An edge coloring in which any pair of vertices with distance up to d, where d is a positive integer that can be connected by a rainbow geodesic is called ...
Khairunnisa N. Afifah, Kiki A. Sugeng
doaj +1 more source
Upper Bounds for the Rainbow Connection Numbers of Line Graphs [PDF]
Graphs and Combinatorics, 2011 11 ...
Xueliang Li 0001, Yuefang Sun
openaire +3 more sources
The ecology of hope: Building rainbows in education systems
British Educational Research Journal, EarlyView.Abstract Hope is frequently invoked in education, yet rarely theorised. Where it has been theorised, it has been understood in two largely separate ways: as an individual psychological capacity, in the positive‐psychology tradition and as a critical‐emancipatory stance, in the pedagogy of hope.
Jennifer Achari
wiley +1 more source
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 +2 more
wiley +1 more source
PENENTUAN RAINBOW CONNECTION NUMBER DAN STRONG RAINBOW CONNECTION NUMBER PADA GRAF BERLIAN [PDF]
Jurnal Matematika UNAND, 2017 Misalkan G = (V, E) adalah suatu graf. 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. Misalkan u, v ∈ V (G) dan P adalah suatu lintasan dari u ke v. Suatu intasan P dikatakan rainbow path jika tidak terdapat dua sisi di P berwarna
openaire +3 more sources
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 +2 more
doaj +1 more source
(1, 2)-rainbow connection number at most 3 in connected dense graphs
Electronic Journal of Graph Theory and Applications, 2023 Let G be an edge-coloured connected graph G. A path P in the graph G is called l-rainbow path if each subpath of length at most l + 1 is rainbow. The graph G is called (k, l)-rainbow connected if any two vertices in G are connected by at least k pairwise
Trung Duy Doan, Le Thi Duyen
doaj +1 more source
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 +6 more
wiley +1 more source
Chromatic Ramsey Numbers and Two‐Color Turán Densities
Journal of Graph Theory, EarlyView.ABSTRACT Given a graph G, its 2‐color Turán number ex ( 2 ) ( n , G ) is the maximum number of edges in an n‐vertex graph, such that the edges can be colored with two colors avoiding a monochromatic copy of G. Let π ( 2 ) ( G ) = lim n → ∞ ex ( 2 ) ( n , G ) / n 2 be the 2‐color Turán density of G.
Maria Axenovich, Simon Gaa, Dingyuan Liu
wiley +1 more source
A Note on Extendable Sets of Colorings and Rooted Minors
Journal of Graph Theory, EarlyView.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