Results 61 to 70 of about 2,302 (247)

Gap vertex-distinguishing edge colorings of graphs [PDF]

, 2012
In this paper, we study a new coloring parameter of graphs called the gap vertex-distinguishing edge coloring. It consists in an edge-coloring of a graph G which induces a vertex distinguishing labeling of G such that the label of each vertex is given by
Kheddouci, Hamamache, Tahraoui, Mohammed Amin, Duchêne, E., Duchene, Eric, Kheddouci, H., E. Duchêne, H. Kheddouci, Tahraoui, M.A., M.A. Tahraoui   +8 more
core   +1 more source

Generation of Self‐Organizing Macrovascular Constructs by Bioprinting Human iPSC‐Derived Mesodermal Progenitor Cells

Advanced Science, EarlyView.
ABSTRACT Vascularization remains a major obstacle in tissue engineering. Here, we introduce a bioprinting strategy to generate centimeter‐scale, self‐organizing “mother vessel” constructs from iPSC‐derived hiMPCs. By optimizing bioink composition, printing was accomplished in a single‐step approach. Within one week, hiMPCs differentiated into both CD31+
Leyla E. Dogan, Nathaly A. Chicaiza‐Cabezas, Florian Kleefeldt, Philipp Wörsdörfer, Jürgen Groll, Süleyman Ergün   +5 more
wiley   +1 more source

2-distance vertex-distinguishing total coloring of graphs [PDF]

, 2018
A [Formula: see text]-distance vertex-distinguishing total coloring of a graph [Formula: see text] is a proper total coloring of [Formula: see text] such that any pair of vertices at distance [Formula: see text] have distinct sets of colors.
Weifan Wang, Yafang Hu
core   +1 more source

General Vertex-Distinguishing Total Colorings of Complete Bipartite Graphs

Mathematics
Let G be a simple graph. A general total coloring f of G refers to a coloring of the vertices and edges of G. Let C(x) be the set of colors of vertex x and edges incident with x under f. For a general total coloring f of G in which k colors are available,
Xiang’en Chen, Ting Li
doaj   +1 more source

Dynamic Evolution‐Controlled Parabolic‐Shaped Microstructures for Ultra‐Black Surface via Self‐Assembled Microsphere Mask Etching

Advanced Science, EarlyView.
A robust, substrate‐independent fabrication approach overcomes the spectral and geometric limitations of traditional stray‐light suppression. By combining ink spray‐coating with self‐assembled microsphere mask etching, this method produces parabolic‐shaped microstructures on diverse planar and curved engineering components.
Yiming Li, Jianwei Wang, Guoxu Yu, Qunbo Lv, Yuan Ma, Jiadao Wang   +5 more
wiley   +1 more source

CD31+ Cell Enrichment Enhances Therapeutic Effects of Stromal Vascular Fraction in Experimental Primary Osteoarthritis: A Preclinical Study in the Dunkin Hartley Guinea Pig Model

Advanced Science, EarlyView.
Both SVF and CD31+ SVF improve spontaneous osteoarthritis, but CD31+ enrichment refines the therapeutic profile rather than broadly enhancing all effects. More distinct benefits are observed in extracellular matrix remodeling, osteochondral integrity, and subchondral/trabecular bone preservation, supporting CD31+‐enriched SVF as a biologically enhanced
Sijia Zhou, Tobias Winkler, Bin Chen, Marta Grzeski, Yilong Yang, Florian N. Fleckenstein, Dominik Geisel, Alexander Hildebrandt, Daniela Aschenbrenner, Marie Agatha Mohn, Benjamin Claass, January Weiner 3rd, Sven Geissler, Georg N. Duda, Søren P. Sheikh, Oliver Klein, Tazio Maleitzke   +16 more
wiley   +1 more source

Vertex-Distinguishing Total Coloring of Ladder Graphs (<i>N</i>=0(mod 8) ) [PDF]

, 2011
A proper total coloring of a simple graph G is called vertex distinguishing if for any two distinct vertices u and v in G, the set of colors assigned to the elements incident to u differs from the set of colors incident to v. The minimal number of colors
Zhi Wen Wang
core   +1 more source

Hardware‐Attentive Programmable Fourier Ptychography Enables Task‐Adaptive Label‐Free Virtual Staining

Advanced Science, EarlyView.
Task‐adaptive programmable optics enables label‐free virtual staining through optical‐attention‐guided acquisition and reconstruction. By optimizing wavelength, illumination angle, exposure time, and imaging depth, the framework learns task‐relevant optical measurements, generating clinically interpretable virtual stains with improved fidelity, non ...
Tianyue He, Wenyi Jing, Le Zhang, Qican Zhang, Tingdong Kou, Xin He, Yan Qiu, Yang Lu, Jian Cui, Yongfu Wen, Zhenrong Zheng, Hongying Zhang, Dayong Jin, Junfei Shen   +13 more
wiley   +1 more source

Edge-locating coloring of graphs

Electronic Journal of Graph Theory and Applications
An edge-locating coloring of a simple connected graph G is a partition of its edge set into matchings such that the vertices of G are distinguished by the distance to the matchings.
Meysam Korivand, Doost Ali Mojdeh, Edy Tri Baskoro, Ahmad Erfanian   +3 more
doaj   +1 more source

On the Vertex-Distinguishing Edge Chromatic Number of 𝐏𝐦 ∨ 𝐂𝐧

DEStech Transactions on Engineering and Technology Research, 2017
A proper edge coloring of graph G is called equitable adjacent strong edge coloring if colored sets from every two adjacent vertices incident edge are different, and the number of edges in any two color classes differ by at most one, which the required minimum number of colors is called the adjacent strong equitable edge chromatic number. In this paper,
Chuan-cheng ZHAO, Shu-xia YAO, Zhi-guo REN   +2 more
openaire   +2 more sources