Results 61 to 70 of about 199,356 (251)

Social Structure Decomposition With Security Issue

open access: yesIEEE Access, 2019
Social structure decomposition has been a valuable research topic in the study of social networks, and it still has many unresolved problems. At the same time, an increasing number of people pays attention to the security issue that is worth considering ...
Wenshun Teng   +3 more
doaj   +1 more source

Engineering a Human‐Sized Common Bile Duct Prototype with Regenerative Potential: In Vitro Evaluation of Mechanics, Function, Degradation, and Immune Modulation

open access: yesAdvanced Healthcare Materials, EarlyView.
This study presents a multiphasic bile duct construct composed of biocompatible materials and cells, featuring an inner layer that supports biliary epithelium growth, a middle layer providing mechanical strength, and an outer cell‐permissive layer designed to support future in vivo integration.
Mattia Pasqua   +9 more
wiley   +1 more source

Computing Some Topological Indices of Two Kinds of Dendrimer Graphs Gn and Hn

open access: yesJournal of Mathematics
Dendrimer molecules are macromolecules which have many applications in nanosciences, drug delivery, biology, and different areas of sciences. Topological indices of chemical graph theory are numerical descriptor of a molecular structure.
Hojat Kaviani, Lotfallah Pourfaraj
doaj   +1 more source

Spectral characterizations of sun graphs and broken sun graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2009
Several matrices can be associated to a graph such as the adjacency matrix or the Laplacian matrix. The spectrum of these matrices gives some informations about the structure of the graph and the question ''Which graphs are determined by their spectrum?''
Romain Boulet
doaj   +1 more source

Scattering theory and discrete-time quantum walks

open access: yes, 2004
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each.
Ambainis   +21 more
core   +1 more source

Functionalized Reduced Graphene Oxide‐Based Nanocomposite Hydrogels for Enhanced Osteogenesis in Bone Tissue Engineering

open access: yesAdvanced Healthcare Materials, EarlyView.
Charge‐opposed reduced graphene oxide fillers are co‐integrated into biopolymeric nanocomposite scaffolds, synergistically enhance osteogenesis. Multiscale characterization reveals how surface chemistry and porosity dictate ectopic mineral architecture.
George Mihail Vlăsceanu   +8 more
wiley   +1 more source

A New Type-2 Soft Set: Type-2 Soft Graphs and Their Applications

open access: yesAdvances in Fuzzy Systems, 2017
The correspondence between a vertex and its neighbors has an essential role in the structure of a graph. Type-2 soft sets are also based on the correspondence of primary parameters and underlying parameters.
Khizar Hayat   +3 more
doaj   +1 more source

Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs

open access: yesMathematics, 2018
In graph theory, a graph is given names—generally a whole number—to edges, vertices, or both in a chart. Formally, given a graph G = ( V , E ) , a vertex naming is a capacity from V to an arrangement of marks.
Xiujun Zhang   +3 more
doaj   +1 more source

Practical Guide to the Design of Granular Hydrogels for Customizing Complex Cellular Microenvironments

open access: yesAdvanced Healthcare Materials, EarlyView.
Granular hydrogels are emerging microporous platforms for cell culture and delivery, showing great potential for replicating the complex, heterogeneous environments found in natural tissues. This review outlines the design principles of granular hydrogels, highlighting critical factors that determine the final physicochemical properties of the entire ...
Shuhan Feng, Kaiyang Chen, Shiqi Wang
wiley   +1 more source

The forwarding indices of graphs - a survey [PDF]

open access: yesOpuscula Mathematica, 2013
A routing \(R\) of a connected graph \(G\) of order \(n\) is a collection of \(n(n-1)\) simple paths connecting every ordered pair of vertices of \(G\).
Jun-Ming Xu, Min Xu
doaj   +1 more source

Home - About - Disclaimer - Privacy