Results 51 to 60 of about 110,665 (282)
On sets of irreducible polynomials closed by composition
, 2016 Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting entirely of ...
A Batra +13 more
core +1 more source
Unleashing the Power of Machine Learning in Nanomedicine Formulation Development
Advanced Functional Materials, EarlyView.A random forest machine learning model is able to make predictions on nanoparticle attributes of different nanomedicines (i.e. lipid nanoparticles, liposomes, or PLGA nanoparticles) based on microfluidic formulation parameters. Machine learning models are based on a database of nanoparticle formulations, and models are able to generate unique solutions
Thomas L. Moore +7 more
wiley +1 more source
Advanced Functional Materials, EarlyView.In this study, the preparation techniques for silver‐based gas diffusion electrodes used for the electrochemical reduction of carbon dioxide (eCO2R) are systematically reviewed and compared with respect to their scalability. In addition, physics‐based and data‐driven modeling approaches are discussed, and a perspective is given on how modeling can aid ...
Simon Emken +6 more
wiley +1 more source
Fuzzy Chromatic Polynomial of Fuzzy Graphs with Crisp and Fuzzy Vertices Using α-Cuts
Advances in Fuzzy Systems, 2019 Coloring of fuzzy graphs has many real life applications in combinatorial optimization problems like traffic light system, exam scheduling, register allocation, etc.
Mamo Abebe Ashebo +1 more
doaj +1 more source
Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics
Algorithms, 2019 The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article.
Hristo N. Djidjev +4 more
doaj +1 more source
Entropy and Multi-Fractal Analysis in Complex Fractal Systems Using Graph Theory
Axioms, 2023 In 1997, Sierpinski graphs, S(n,k), were obtained by Klavzar and Milutinovic. The graph S(1,k) represents the complete graph Kk and S(n,3) is known as the graph of the Tower of Hanoi. Through generalizing the notion of a Sierpinski graph, a graph named a
Zeeshan Saleem Mufti +3 more
doaj +1 more source
Predicting Atomic Charges in MOFs by Topological Charge Equilibration
Advanced Functional Materials, EarlyView.An atomic charge prediction method is presented that is able to accurately reproduce ab‐initio‐derived reference charges for a large number of metal–organic frameworks. Based on a topological charge equilibration scheme, static charges that fulfill overall neutrality are quickly generated.
Babak Farhadi Jahromi +2 more
wiley +1 more source
Problems on chromatic polynomials of hypergraphs
Electronic Journal of Graph Theory and Applications, 2020 Chromatic polynomials of graphs have been studied extensively for around one century. The concept of chromatic polynomial of a hypergraph is a natural extension of chromatic polynomial of a graph. It also has been studied for more than 30 years.
Ruixue Zhang, Fengming Dong
doaj +1 more source
Coloring Rings in Species [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We present a generalization of the chromatic polynomial, and chromatic symmetric function, arising in the study of combinatorial species. These invariants are defined for modules over lattice rings in species.
Jacob White
doaj +1 more source
Further study of eccentricity based indices for benzenoid hourglass network
Heliyon, 2023 Topological Indices are the mathematical estimate related to atomic graph that corresponds biological structure with several real properties and chemical activities. These indices are invariant of graph under graph isomorphism.
Hifza Iqbal +6 more
doaj +1 more source