Results 131 to 140 of about 1,144,592 (210)

Graceful Graphs With Pendant Edges

open access: yes, 2005
A graceful labeling of a graph G of size n is an injective assignment of labels from {0,1,... n} to the vertices of G such that when each edge of G has assigned a weight defined by the absolute difference of its end-vertices, the resulting weights are ...
Barrientos, Christian
core  

How can children and young people have a voice in urban treescapes?

open access: yesPeople and Nature, EarlyView.
Abstract Scientific understanding of climate change has, to date, failed to result in sufficient action. This paper proposes that a deficit model of top‐down learning and dissemination in relation to public engagement with science may be part of the problem, particularly when considering the attitudes, values and empowerment of children and young ...
Simon Carr   +10 more
wiley   +1 more source

Multi‐scale flow analysis for scale‐aware urban canopy models

open access: yesQuarterly Journal of the Royal Meteorological Society, EarlyView.
We found that scale‐aware models are necessary when numerical weather prediction models approach hectometric resolution, which is associated with a characteristic length‐scale of morphological heterogeneity. This morphology‐dependent length‐scale indicates that resolved and unresolved heterogeneity are equally important.
Jingzi Huang, Maarten van Reeuwijk
wiley   +1 more source

Graceful Labelling of Edge Amalgamation of Cycle Graph

open access: yesJournal of Physics: Conference Series, 2018
D E Nurvazly, K A Sugeng
openaire   +1 more source

ADAPT: An Autonomous Forklift for Construction Site Operation

open access: yesJournal of Field Robotics, EarlyView.
ABSTRACT Efficient material logistics are critical in controlling costs and schedules in the construction industry. However, manual material handling remains prone to inefficiencies, delays, and safety risks. Autonomous forklifts offer a solution to streamline on‐site logistics, reducing reliance on human operators and mitigating labor shortages.
Johannes Huemer   +12 more
wiley   +1 more source

Graceful Kayak Paddles

open access: yes, 2011
University of Minnesota M.S. thesis. December 2011. Major: Applied and computational Mathematics. Advisor: Dalibor Froncek. 1 computer file (PDF); iv, 31 pages.A kayak paddle is a graph made of two cycles joined by a path.
Litersky, Ann
core  

Robotics for Crop Pollination: Recent Advances and Future Direction

open access: yesJournal of Field Robotics, EarlyView.
ABSTRACT There is great interest in alternative pollination strategies for crop production in the face of climate change and perennial threats to the traditional pollination mechanisms. This review explores the potential of robotic pollination as a promising solution to these challenges affecting crop fertilization, agricultural sustainability, and ...
Ranjan Sapkota   +3 more
wiley   +1 more source

On odd-graceful coloring of graphs

open access: yes
For a graph G(V, E) which is undirected, simple, and finite, we denote by |V | and |E| the cardinality of the vertex set V and the edge set E of G, respectively. A graceful labeling f for the graph G is an injective function f : V → {0, 1, 2, . . . , |E|}
I. Nengah Suparta (21320564)   +3 more
core  

Machine learning‐driven advances in carbon‐based quantum dots: Opportunities accompanied by challenges

open access: yesResponsive Materials, EarlyView.
Machine learning provides a unifying framework to connect structure, fluorescence properties, and applications of carbon‐based quantum dots. This review highlights how data‐driven strategies enable fluorescence regulation, reveal underlying mechanisms, and accelerate the rational design of functional carbon dots.
Liangfeng Chen   +8 more
wiley   +1 more source

Graceful Graphs and Graceful Labelings: Two Mathematical Programming Formulations and Some Other New Results

open access: yes, 2003
Given a graph G consisting of vertices and edges, a vertex labeling of G is an assignment f of labels to the vertices of Gthat produces for each edge xy a label depending on the vertex labels f(x) and f(y).
Redl, Timothy A.
core  

Home - About - Disclaimer - Privacy