Results 91 to 100 of about 1,724,695 (249)
Graph Homomorphism Revisited for Graph Matching [PDF]
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core
Tulgeity of Line, Middle and Total Graph of Wheel Graph Families [PDF]
Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm ...
Vernold, Vivin +2 more
core +1 more source
Conformational Switching of Proteins on Material Surfaces Enabled by Peptide‐Oriented Adsorption
Responsive biointerfaces could be achieved using conformationally responsive proteins; however, their interconversion can be lost upon surface adsorption. Herein, we demonstrate that the incorporation a Au binding peptide into calmodulin allows for binding control on Au wherein the protein retains conformational switching. This capability was confirmed
Sakthirupini Ramamurthy +7 more
wiley +1 more source
The Oriented Graph Complexes [PDF]
The oriented graph complexes $${GC^{or}_n}$$ G C n o r are complexes of directed graphs without directed cycles. They govern, for example, the quantization of Lie bialgebras and infinite dimensional deformation quantization. Similar to the ordinary graph
Willwacher, Thomas
core
This study advances SafeWax, a bio‐inspired, fatty‐acids‐based superhydrophobic coating, by identifying an agriculturally compliant solvent and revealing how solvent‐controlled Fatty acid crystallization governs the coating's microscopic structure and performance.
Niv Ben‐Arie +13 more
wiley +1 more source
On Pathos Semitotal and Total Block Graph of a Tree [PDF]
The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number of line disjoint open paths whose union is G. The path number of a graph G is the number of paths in pathos.
Muddebihal M. H.
core +1 more source
Task-oriented scene data in big data and cloud environments of a smart city that must be time-critically processed are dynamic and associated with increasing complexities and heterogeneities. Existing hybrid tree-based external indexing methods are input/
Bin Feng +9 more
doaj +1 more source
Physics‐Grounded Materials Artificial Intelligence for Reliable Materials Discovery
Physics‐Grounded Materials AI (PhysMat AI) integrates physical priors, descriptors, constraints, verification, and data infrastructure into a unified full‐stack framework, enabling reliable, interpretable, and autonomous AI‐driven materials discovery.
Yuhang Wang +3 more
wiley +1 more source
Bond Graph Based Stability Analysis of a Railway Traction System [PDF]
This paper emphasises the interest of the Bond Graph approach for analysis and system design of heterogeneous and multi-field devices. In particular, the local stability analysis of non linear systems can be directly derived from the linearised Causal ...
Sareni, Bruno +3 more
core
Advanced ink systems for solution‐processed textile triboelectric nanogenerators are systematically summarized, spanning conductive, tribo‐negative, and tribo‐positive layers. By connecting ink chemistry, deposition methods, and device function, the present review reveals the key governing principles of solution development and highlights practical ...
Xinlong Sun, Stephen Beeby
wiley +1 more source

