Results 81 to 90 of about 1,445 (260)

Care Praxis–Driven STEM Design for Sustainable and Just Communities in Middle School

open access: yesJournal of Research in Science Teaching, EarlyView.
ABSTRACT Despite the growing interest in incorporating care ethics into STEM education, these topics are rarely integrated into K‐12 standards and pedagogical practice. We explore how care praxis, a political and ethical approach to STEM education, supports students' sense‐making in addressing real‐world problems throughout STEM design, merging social,
Wisam Sedawi   +2 more
wiley   +1 more source

RAINBOW VERTEX CONNECTION NUMBER OF BULL GRAPH, NET GRAPH, TRIANGULAR LADDER GRAPH, AND COMPOSITION GRAPH (P_n [P_1 ])

open access: yesBarekeng
The rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi   +3 more
doaj   +1 more source

Rainbow Connection Number of Graphs with Diameter 3

open access: yesDiscussiones Mathematicae Graph Theory, 2017
A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. The rainbow connection number rc(G) of G is the smallest integer k for which there exists a k-edge-coloring of G such that every pair of distinct vertices of G
Li Hengzhe, Li Xueliang, Sun Yuefang
doaj   +1 more source

Exploring Interactive Effects of Arsenic and Selenium Exposure on Larval Zebrafish (Danio rerio)

open access: yesEnvironmental Toxicology, EarlyView.
ABSTRACT Arsenic contamination in aquatic ecosystems is a major environmental concern. Selenium (Se) helps mitigate oxidative stress and hence could reduce the toxic effects of arsenic. However, Se can also be toxic at high concentrations. Given that these metalloids commonly co‐occur in the environment, there is a pressing need for further research ...
Owen Luo   +6 more
wiley   +1 more source

Rainbow mean colorings of graphs

open access: yesDiscrete Mathematics Letters, 2019
Summary: A mean coloring of a connected graph \(G\) of order 3 or more is an edge coloring \(c\) of \(G\) with positive integers where the average of the colors of the edges incident with each vertex \(v\) of \(G\) is an integer. This average is the chromatic mean of \(v\).
Gary Chartrand   +3 more
openaire   +2 more sources

Antimicrobial Residues in a Key Cerrado River: Distribution, Persistence, and Effects on Zebrafish Embryo‐Larval Development

open access: yesEnvironmental Toxicology, EarlyView.
ABSTRACT The current study aimed to quantify the antimicrobials amoxicillin (AMX), cefazolin (CFZ), chloramphenicol (CHL), metronidazole (MTZ), and sulfamethoxazole (SX) in effluents and surface water of an important Cerrado river, calculate their half‐lives, and analyze their ecotoxicity following single and combined exposures.
Náthala Maria Simão   +12 more
wiley   +1 more source

Rainbow connection number of corona product of graphs

open access: yesElectronic Journal of Graph Theory and Applications
In an edge-colored graph (where adjacent edges may have the same color), a rainbow path is a path whose edge colors are all distinct. The coloring is called a rainbow coloring if any two vertices can be connected by a rainbow path. The rainbow connection
Fendy Septyanto
doaj   +1 more source

Influence of Age and Exposure Pathway on Copper and Cadmium Mixture Toxicity: A Study on Daphnia magna

open access: yesEnvironmental Toxicology, EarlyView.
ABSTRACT Metal contamination in aquatic ecosystems poses substantial risks to freshwater organisms, with mixture effects often deviating from predictions based on single‐metal toxicity. Understanding how age‐specific sensitivities and multiple exposure pathways influence mixture effects is critical for accurate risk assessment.
Sanah Majid   +3 more
wiley   +1 more source

Generalized Rainbow Connection of Graphs and their Complements

open access: yesDiscussiones Mathematicae Graph Theory, 2018
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

Anti-Ramsey theory on complete bipartite graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
We consider quadruples of positive integers with and such that every proper edge-coloring of the complete bipartite graph contains a rainbow subgraph. We show that every such quadruple with and satisfies this property and find an infinite sequence where ...
Stephan Cho   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy