Results 41 to 50 of about 6,714 (280)
On the edge-balanced index sets of product graphs [PDF]
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
Strategies for Loading and Releasing Peptide Therapeutics in Biodegradable Carriers
A biodegradable carrier‐based peptide delivery system is a powerful treatment platform for diverse diseases, owing to its superior therapeutic efficacy and low toxicity. This review examines the conventional peptide‐loaded carrier fabrication process and its current limitations.
Wookyoung Jang, Ki Wan Bong
wiley +1 more source
The concept of graph labeling was introduced in mid-1960 by Rosa. In this paper, we introduce a notion of graceful labeling of a finite poset. We obtain graceful labeling of some postes such as a chain, a fence, and a crown. In 2002 Thakare, Pawar, and Waphare introduced the ‘adjunct’ operation of two lattices with respect to an adjunct pair of ...
Bhavale AN, Shelke DS
openaire +1 more source
Graceful labeling of hexagonal snakes [PDF]
Consider a graph G with p number of vertices and q number of edges. If the edges of the graph are labeled by subtracting the corresponding vertex label of the respective edges following the condition that the labels of the vertices and edges are distinct is known as Graceful labeling of a graph.
Lalitha Pattabiraman +2 more
openaire +1 more source
Bioengineered Lymphatic Vessels in Synthetic Matrices to Study Breast Cancer Cell Functions
Lymphatic vessels are involved in cancer metastasis. To study the interplay between metastasizing cancer cells and lymphatic vessels under highly reproducible conditions, advanced in vitro models are required. In this work, 3D lymphatic networks are formed in biomimetic hydrogels and their interactions with invasive and non‐invasive cancer cell‐lines ...
Rodi Odabasi +7 more
wiley +1 more source
All trees are six-cordial [PDF]
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
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
Decoupling Dynamics and Crosslink Stability in Supramolecular Hydrogels Using Associative Exchange
How does reorganization impact the stability of supramolecular hydrogels? In contrast to dissociative crosslink exchange, implementing associative exchange in macroscale DNA hydrogels enables decoupling of reorganization dynamics from thermal and mechanical stability.
Pierre Le Bourdonnec +4 more
wiley +1 more source
Pelabelan Graceful pada Digraf Lintasan dan Digraf Bipartit Lengkap [PDF]
A graceful labeling of digraph is a one to one function------ --------------------------- such that each arc in D is labeled with , the resulting arc labels are distinct.
Fatekurohman, M. (M) +2 more
core
Edge Odd Graceful Labeling in Some Wheel-Related Graphs
A graph’s edge labeling involves the allocation of symbols (colors or numbers) to the edges of a graph governed by specific criteria. Such labeling of a graph G with order n and size m is named edge odd graceful if there is a bijective map φ from the set
Mohammed Aljohani, Salama Nagy Daoud
doaj +1 more source

