Results 91 to 100 of about 728,663 (278)

THE ECCENTRIC DIGRAPH OF FRIENDSHIP GRAPH AND FIRECRACKER GRAPH [PDF]

open access: yes, 2012
Let G be a graph with a set of vertices and a set of edges Then the distance from vertex u to vertex v in G, denoted by is the length of the shortest path from vertex u to v.
Kusmayadi , Tri Atmojo   +1 more
core  

Microgels Enable iPSCs to Assemble, Expand, and Differentiate Into Organoids—From Sizable to High‐Throughput

open access: yesAdvanced Materials, EarlyView.
A chemically defined PEG‐based microgel platform enables scalable, reproducible production of three‐dimensional microgel‐iPSC constructs in multiple sizes. The system is compatible with high‐throughput automation and supports human iPSC expansion and differentiation within a single construct, including directed differentiation into cardiac organoids ...
Laura Klasen   +8 more
wiley   +1 more source

Biomass DNA: An Emerging Building Block for Advanced Materials

open access: yesAdvanced Materials, EarlyView.
Biomass DNA is rapidly emerging from its traditional role as a genetic blueprint to serve as a versatile abundant, highly programmable polymeric building block. This review highlights the transformation of macroscopic bulk biomass DNA into next generation of functional materials, spanning from dynamic hydrogels, sustainable bioplastics, and high ...
Yuwei Hu, Itamar Willner, Li Niu
wiley   +1 more source

Amphiphilic Non‐Isocyanate Polyurethane Coatings With Tunable Antifouling and Fouling‐Release Performance: A Log‐Ratio Assessment Framework

open access: yesAdvanced Materials Interfaces, EarlyView.
Amphiphilic non‐isocyanate polyurethane (NIPU) coatings containing reactive hydrophobic poly(dimethylsiloxane) (PDMS) and hydrophilic methoxy poly(ethylene glycol) (MPEG) prepolymers for marine antifouling (AF) and fouling‐release (FR) applications were investigated. The coatings were evaluated with a set of representative marine foulants.
Nastaran Shahzadeh   +7 more
wiley   +1 more source

THE ECCENTRIC DIGRAPH OF FRIENDSHIP GRAPH, AND FIRECRACKER GRAPH [PDF]

open access: yes, 2011
Let G be a graph with a set of vertices V(G) and a set of edges E(G). The distance from vertex u to vertex v in G, denoted by d(u,v), is a length of the shortest path from vertex u to v.
Kusmayadi, Tri Atmojo
core  

Direct and extended friendship effects on minority and majority children’s interethnic attitudes: A longitudinal study. [PDF]

open access: yes, 2009
Longitudinal direct and extended cross-ethnic friendship effects on out-group evaluations amongst German (majority status, N = 76) and Turkish (minority status, N = 73) children (age 7-11 yrs) in ethnically heterogeneous elementary schools were examined ...
Rutland, Adam   +6 more
core   +1 more source

Zinc Chloride–Polyethylene Oxide Gel Polymer Electrolytes for Wearable and Flexible Energy Storage Applications

open access: yesAdvanced Materials Technologies, EarlyView.
We investigate gel polymer electrolyte ZnCl2‐PEO as energy storage materials in flexible electrochemical capacitors, aiming to provide new insights into energy solutions for low‐powered portable electronics. ABSTRACT We prepared and evaluated the properties of hydrated ZnCl2‐Polyethylene oxide (PEO) gel polymer electrolyte (H‐GPE) for flexible ...
Jeeva Saju   +6 more
wiley   +1 more source

Further results on edge irregularity strength of graphs

open access: yesIndonesian Journal of Combinatorics, 2017
A vertex $k$-labelling $\phi:V(G)\longrightarrow \{1,2,\ldots,k\}$ is called irregular $k$-labeling of the graph $G$ if for every two different edges $e$ and $f$, there is $w_{\phi}(e)\neq w_{\phi}(f)$; where the weight of an edge is given by $e=xy\in E ...
Muhammad Imran   +3 more
doaj   +1 more source

The friendship paradox for sparse random graphs

open access: yesProbability Theory and Related Fields
Abstract Let $$G_n$$ G n
Hazra, Rajat Subhra   +2 more
openaire   +2 more sources

Towards a Maude tool for model checking temporal graph properties [PDF]

open access: yes, 2011
We present our prototypical tool for the verification of graph transformation systems. The major novelty of our tool is that it provides a model checker for temporal graph properties based on counterpart semantics for quantified m-calculi.
Lluch-Lafuente, Alberto   +4 more
core   +1 more source

Home - About - Disclaimer - Privacy