Results 31 to 40 of about 4,425 (218)

Block-Graceful Designs

open access: yesJournal of Mathematics, 2023
In this article, we adapt the edge-graceful graph labeling definition into block designs and define a block design V,B with V=v and B=b as block-graceful if there exists a bijection f:B⟶1,2,…,b such that the induced mapping f+:V⟶Zv given by f+x=∑x∈AA ...
Dilara Erdemir, Emre Kolotoğlu
doaj   +1 more source

Vertex Graceful Labeling-Some Path Related Graphs [PDF]

open access: yes, 2013
Treating subjects as vertex graceful graphs, vertex graceful labeling, caterpillar, actinia graphs, Smarandachely vertex m ...
Balaganesan, P.   +2 more
core   +1 more source

Graceful labeling on torch graph

open access: yesIndonesian Journal of Combinatorics, 2018
Let G be a graph with vertex set V=V(G) and edge set E=E(G). An injective function f:V --> {0,1,2,...,|E|} is called graceful labeling if f induces a function f*(uv)=|f(u)-f(v)| which is a bijection from E(G) to the set {1,2,3,...,|E|}.
Jona Martinus Manulang, Kiki A. Sugeng
doaj   +1 more source

On the edge-balanced index sets of product graphs [PDF]

open access: yes, 2011
We characterize strongly edge regular product graphs and find the edge-balanced index sets of complete bipartite graphs without a perfect matching, the direct product $K_n\times K_2$.
Krop, Elliot   +2 more
core   +2 more sources

All trees are six-cordial [PDF]

open access: yes, 2017
For any integer $k>0$, a tree $T$ is $k$-cordial if there exists a labeling of the vertices of $T$ by $\mathbb{Z}_k$, inducing a labeling on the edges with edge-weights found by summing the labels on vertices incident to a given edge modulo $k$ so that ...
Driscoll, Keith   +2 more
core   +2 more sources

Special Graceful Labelings of Irregular Fences and Lobsters

open access: yesUniversal Journal of Mathematics and Applications, 2019
Irregular fences are subgraphs of $P_m \times P_n$ formed with $m$ copies of $P_n$ in such a way that two consecutive copies of $P_n$ are connected with one or two edges; if two edges are used, then they are located in levels separated an odd number of ...
Christian Barrientos
doaj   +1 more source

Lucas Gracefulness of Almost and Nearly for Some Graphs [PDF]

open access: yes, 2011
By a graph, we mean a finite undirected graph without loops or multiple ...
Nagarajan, A.   +2 more
core   +1 more source

Lipid Nanoparticles for the Delivery of CRISPR/Cas9 Machinery to Enable Site‐Specific Integration of CFTR and Mutation‐Agnostic Disease Rescue

open access: yesAdvanced Functional Materials, EarlyView.
Lipid nanoparticles (LNPs) are optimized to co‐deliver Cas9‐encoding messenger RNA (mRNA), a single guide RNA (sgRNA) targeting the endogenous cystic fibrosis transmembrane conductance regulator (CFTR) gene, and homologous linear double‐stranded donor DNA (ldsDNA) templates encoding CFTR.
Ruth A. Foley   +12 more
wiley   +1 more source

Pelabelan Graceful Sisi-ganjil Pada Graf Web W(2,n) [PDF]

open access: yes, 2014
Let G = (V(G),E()) be a graph with vertex set () and edge set (). Assume that graph G have edge. Graceful edge-odd labeling is a bijective map ∶ () → {1, 3, 5,…,2 – 1} that resulting map + : () → {0,1,2,…,2 −1} with
Djuwandi, D. (Djuwandi)   +2 more
core  

Functional Materials for Environmental Energy Harvesting in Smart Agriculture via Triboelectric Nanogenerators

open access: yesAdvanced Functional Materials, EarlyView.
This review explores functional and responsive materials for triboelectric nanogenerators (TENGs) in sustainable smart agriculture. It examines how particulate contamination and dirt affect charge transfer and efficiency. Environmental challenges and strategies to enhance durability and responsiveness are outlined, including active functional layers ...
Rafael R. A. Silva   +9 more
wiley   +1 more source

Home - About - Disclaimer - Privacy