Results 131 to 140 of about 34,319 (321)

A Cu‐Based Near‐IR Active MOF with an Ion‐Pair Guest Exhibiting Versatile and Selective Gas‐Solid Reactivity

Advanced Materials, EarlyView.
The new Cu‐containing MOF (Me2NH2)(CuICl2)@[Cu4(INA)4Cl2O]·1.5dmf (3) contains a cation and an anion as guests and shows UV‐near‐mid‐IR absorption and near‐IR emission. MOF 3 shows gas‐solid reactivity in the presence of NH3 and HCOOH to yield two new 3D MOF.
Rajat Saha, Alejandro Cortés‐Villena, Silvia Gómez‐Coca, Alberto Fernández‐Alarcón, Joaquín Calbo, Raquel E. Galian, Enrique Ortí, Eliseo Ruiz, Mónica Giménez‐Marqués, Samia Benmansour, Carlos J. Gómez‐García   +10 more
wiley   +1 more source

Author Correction: Vertex coloring of graphs via phase dynamics of coupled oscillatory networks. [PDF]

Sci Rep, 2018
Parihar A, Shukla N, Jerry M, Datta S, Raychowdhury A.   +4 more
europepmc   +1 more source

Conflict-Free Vertex Coloring Of Planar Graphs

, 2017
Shawn Seymour
openalex   +2 more sources

Electron Channeling Contrast Imaging of Ferroelastic Domains

Advanced Materials, EarlyView.
A simple scanning electron microscopy technique, electron channeling contrast imaging, unveils nanoscale ferroelastic domains and their coupling to functional properties in oxide heterostructures. The work demonstrates high‐resolution mapping of both surface and buried domains, broadening the experimental toolbox for ferroic and quantum oxide systems ...
Wei Peng, Aditya Singh, M. Haroon Qaiser, Philipp Fahler‐Muenzer, Freya Watson, Liang Si, Yining Xie, Katarzyna E. Sopińska, Daniel A. Chaney, Ana M. Sanchez, T. Ben Britton, Richard Beanland, Marios Hadjimichael, Marin Alexe   +13 more
wiley   +1 more source

Total dominator chromatic number of some operations on a graph

Bulletin of Computational Applied Mathematics, 2018
Let G be a simple graph. A total dominator coloring of G is a proper coloring of the vertices of G in which each vertex of the graph is adjacent to every vertex of some color class.
Nima Ghanbari, Saeid Alikhani
doaj  

THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS

Barekeng
The concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs.
Ariestha Widyastuty Bustan, Taufan Talib, Novita Serly Laamena, Lamanisa Rasid Saputra, Nurhayati Nurhayati   +4 more
doaj   +1 more source

Vertex coloring of graphs via phase dynamics of coupled oscillatory networks. [PDF]

Sci Rep, 2017
Parihar A, Shukla N, Jerry M, Datta S, Raychowdhury A.   +4 more
europepmc   +1 more source

Joint Mode Selection and Resource Allocation for D2D Communications via Vertex Coloring [PDF]

, 2017
Yi Li, M. Cenk Gursoy, Senem Velipasalar, Jian Tang   +3 more
openalex   +1 more source

A Biochar‐Based Composite Hydrogel Microenvironment for Enhanced Biocatalysis

Advanced Materials, EarlyView.
This work presents the synthesis of a polyacrylamide hydrogel wherein biomass‐derived biochar is co‐encapsulated with the enzyme horseradish peroxidase (HRP). The resulting composite hydrogel possesses balanced electron‐rich and electron‐deficient domains, creating an optimal microenvironment that concentrates both hydrogen peroxide and phenol ...
Shengzhe Wang, Jingling Zhu, Weiyang Xue, Yuting Wen, Zhongxing Zhang, Xia Song, Yuan Yu, Chenglin Sun, Huangzhao Wei, Jun Li   +9 more
wiley   +1 more source

The b$_q$-coloring of graphs [PDF]

Discrete Mathematics Letters, 2023
Brice Effantin
doaj   +1 more source