Results 91 to 100 of about 357,448 (292)
Characterizing block graphs in terms of their vertex-induced partitions [PDF]
, 2016 Block graphs are a generalization of trees that arise in areas such as metric graph theory, molecular graphs, and phylogenetics. Given a finite connected simple graph $G=(V,E)$ with vertex set $V$ and edge set $E\subseteq \binom{V}{2}$, we will show that
Dress, A +4 more
core
Advanced Materials, EarlyView.This review provides the state‐of‐the‐art overview of halide perovskite‐based photocatalysts for hydrogen production from water and halogen acid solutions, CO2 reduction into value‐added chemicals, and organic chemical transformations. Different types of halide perovskite photocatalysts and their relative efficiencies for hydrogen generation and CO2 ...
Siddharth Singh +8 more
wiley +1 more source
Computing Some Topological Indices of Two Kinds of Dendrimer Graphs Gn and Hn
Journal of MathematicsDendrimer 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
AI‐Driven Defect Engineering for Advanced Thermoelectric Materials
Advanced Materials, EarlyView.This review presents how AI accelerates the design of defect‐tuned thermoelectric materials. By integrating machine learning with high‐throughput data and physics‐informed representations, it enables efficient prediction of thermoelectric performance from complex defect landscapes.
Chu‐Liang Fu +9 more
wiley +1 more source
A New Type-2 Soft Set: Type-2 Soft Graphs and Their Applications
Advances 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
Testing Equality in Communication Graphs
, 2016 Let $G=(V,E)$ be a connected undirected graph with $k$ vertices. Suppose that on each vertex of the graph there is a player having an $n$-bit string. Each player is allowed to communicate with its neighbors according to an agreed communication protocol ...
Alon, Noga +2 more
core +1 more source
Advanced Materials Technologies, EarlyView.This study investigates how laser‐micromachined patterns enhance the interfacial and mechanical properties of bioinspired ceramic composites. The ±45° micro‐pattern significantly improved interfacial bonding and damage dissipation energy by 107%, while integrating micro‐ and macro‐designs increased energy absorption by 60%.
E. Azad +4 more
wiley +1 more source
Edge Irregular Reflexive Labeling for the Disjoint Union of Gear Graphs and Prism Graphs
Mathematics, 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
The forwarding indices of graphs - a survey [PDF]
Opuscula 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
Advanced Optical Materials, EarlyView.A new heavy‐atom‐free, donor–acceptor‐type organoboron luminophore has been synthesized, which exhibits red room‐temperature phosphorescence (RTP) in the crystalline state. Furthermore, the amorphous solid generated by grinding shows green thermally activated delayed fluorescence (TADF), displaying distinct mechanochromic luminescence (MCL) through ...
Yohei Adachi +7 more
wiley +1 more source