Results 51 to 60 of about 38,756 (312)
Perfect commuting graphs [PDF]
Journal of Group Theory, 2016 Abstract We classify the finite quasisimple groups whose commuting graph is perfect and we give a general structure theorem for finite groups whose commuting graph is perfect.
Britnell JR, Gill N
openaire +4 more sources
Advanced Functional Materials, EarlyView.This study examines how pore shape and manufacturing‐induced deviations affect the mechanical properties of 3D‐printed lattice materials with constant porosity. Combining µ‐CT analysis, FEM, and compression testing, the authors show that structural imperfections reduce stiffness and strength, while bulk material inhomogeneities probably enhance ...
Oliver Walker +5 more
wiley +1 more source
A sharp lower bound on the signless Laplacian index of graphs with (κ,τ)-regular sets
Special Matrices, 2018 A new lower bound on the largest eigenvalue of the signless Laplacian spectra for graphs with at least one (κ,τ)regular set is introduced and applied to the recognition of non-Hamiltonian graphs or graphs without a perfect matching.
Andeelić Milica +2 more
doaj +1 more source
OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS
Ural Mathematical Journal, 2020 Let \(G\) be a graph with the vertex set \(V(G)\). A subset \(S\) of \(V(G)\) is an open packing set of \(G\) if every pair of vertices in \(S\) has no common neighbor in \(G.\) The maximum cardinality of an open packing set of \(G\) is the open ...
K. Raja Chandrasekar, S. Saravanakumar
doaj +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
Le Matematiche, 1992 Let q be a positive integer. Many graphs admit a partial coloring with q colors and a clique partition such that each of the cliques is strongly colored, that is: contains the largest possible number of different colors.
Claude Berge
doaj
Critical perfect graphs and perfect 3-chromatic graphs
Journal of Combinatorial Theory, Series B, 1977 AbstractThis paper builds on results based on D. R. Fulkerson's antiblocking polyhedra approach to perfect graphs to obtain information about critical perfect graphs and related clique-generated graphs. Then we prove that Berge's Strong Perfect Graph Conjecture is valid for 3-chromatic graphs.
openaire +2 more sources
Advanced Functional Materials, EarlyView.This review highlights how machine learning (ML) algorithms are employed to enhance sensor performance, focusing on gas and physical sensors such as haptic and strain devices. By addressing current bottlenecks and enabling simultaneous improvement of multiple metrics, these approaches pave the way toward next‐generation, real‐world sensor applications.
Kichul Lee +17 more
wiley +1 more source
Characterization of perfect matching transitive graphs
Electronic Journal of Graph Theory and Applications, 2018 A graph G is perfect matching transitive, shortly PM-transitive, if for any two perfect matchings M and N of G, there is an automorphism f : V(G) ↦ V(G) such that fe(M) = N, where fe(uv) = f(u)f(v). In this paper, the author proposed the definition of PM-
Ju Zhou
doaj +1 more source
Perfect 2-colorings of the cubic graphs of order less than or equal to 10
AKCE International Journal of Graphs and Combinatorics, 2020 Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect -coloring of a graph with colors is a partition of the vertex set of into m parts , . . .
Mehdi Alaeiyan, Ayoob Mehrabani
doaj +1 more source