Results 51 to 60 of about 39,180 (264)
Recognition of Unipolar and Generalised Split Graphs
Algorithms, 2015 A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar.
Colin McDiarmid, Nikola Yolov
doaj +1 more source
On Another Class of Strongly Perfect Graphs
Mathematics, 2022 For a commutative ring R with unity, the associate ring graph, denoted by AG(R), is a simple graph with vertices as nonzero elements of R and two distinct vertices are adjacent if they are associates.
Neha Kansal +3 more
doaj +1 more source
Advanced Engineering Materials, EarlyView.Reproduction of stacking fault energy calculations from literature with a semi‐automated large language model‐assisted extraction procedure: extraction of simulation protocol, atomistic structures, computational parameters, and reported results, ontology alignment, knowledge graph construction and, finally, recomputation forvalidation.
Sepideh Baghaee Ravari +5 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
A characterization of perfect graphs
Journal of Combinatorial Theory, Series B, 1972 AbstractIt is shown that a graph is perfect iff maximum clique · number of stability is not less than the number of vertices holds for each induced subgraph. The fact, conjectured by Berge and proved by the author, follows immediately that the complement of a perfect graph is perfect.
openaire +2 more sources
Journal of Graph Theory, 2005 AbstractFor 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k − 1, in which i ∼j if d ≤ |i − j| ≤ k − d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is
openaire +1 more source
Additive Manufacturing of Alumina‐Reinforced Elastomers
Advanced Engineering Materials, EarlyView.Vat‐photopolymerized elastomers reinforced with platelet‐shaped alumina exhibited preferential orientation, reduced porosity, and significantly enhanced mechanical performance. A 3 wt% platelet loading increased tensile strength from 12.4 to 45.7 MPa, highlighting the critical role of filler morphology in elastomeric VPP composites.
Majid Barzegar Keyvani +6 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
Discrete Mathematics, 1986 Let G be a graph. The authors denote by \(\alpha_ N(G)\) the maximum number of edges of G such that no two of them belong to the same neighborhood subgraph of G (that is a subgraph induced by a vertex v and the vertices adjacent to v). They denote by \(\rho_ N(G)\) the minimum number of vertices whose neighborhood subgraphs cover the edge set of G.
Jenö Lehel, Zsolt Tuza
openaire +1 more source
Advanced Engineering Materials, EarlyView.This review comprehensively evaluates extrusion‐based additive manufacturing for advanced ceramics, detailing feedstock options and key process parameters. By critically addressing defect mechanisms like porosity and cracking, the work highlights optimization strategies through machine learning and advanced postprocessing.
Meisam Bakhtiari +4 more
wiley +1 more source