Results 61 to 70 of about 43,364 (297)
Progress on perfect graphs [PDF]
Mathematical Programming, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maria Chudnovsky +3 more
openaire +1 more source
Laser‐Induced Graphene from Waste Almond Shells
Advanced Functional Materials, EarlyView.Almond shells, an abundant agricultural by‐product, are repurposed to create a fully bioderived almond shell/chitosan composite (ASC) degradable in soil. ASC is converted into laser‐induced graphene (LIG) by laser scribing and proposed as a substrate for transient electronics.
Yulia Steksova +9 more
wiley +1 more source
Bipartite Graphs Associated with Pell, Mersenne and Perrin Numbers
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 In this paper, we consider the relationships between the numbers of perfect matchings (1-factors) of bipartite graphs and Pell, Mersenne and Perrin Numbers.
Öteleş Ahmet
doaj +1 more source
Perfect codes in some products of graphs
Electronic Journal of Graph Theory and Applications, 2021 A r-perfect code in a graph G = (V(G),E(G)) is a subset C of V(G) for which the balls of radius r centered at the vertices of C form a partition of V(G).
Samane Bakaein +2 more
doaj +1 more source
Electronic Notes in Discrete Mathematics, 2002 Abstract A graph is perfect if each of its induced subgraphs H has the property that its chromatic number χ(H) equals its clique number ω(H). The Strong Perfect Graph Conjecture (SPGC) states: An undirected graph is perfect if and only if neither G nor its complement G contains, as an induced subgraph, a chordless cycle whose length is odd and ...
Agnes V. Dizon-Garciano +2 more
openaire +1 more source
Advanced Functional Materials, EarlyView.Thermally oxidized MoS2‐based radio‐frequency switches enable a multifunctional platform that unifies broadband RF switching and in‐memory computation. The device achieves a cutoff frequency of 33.2 THz with high energy efficiency and supports hardware‐aware signal processing.
Juho Son +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
Twin Crystal Moiré Metasurfaces for Crossing Flat‐Band Transport
Advanced Functional Materials, EarlyView.This study introduces twin crystal moiré metasurfaces, breaking in‐plane symmetry to enable reconfigurable acoustic wave manipulation. By adjusting the twin angle and interlayer twist angle, various combinations of hyperbolic, flat bands, and elliptic states can be synthesized in the system.
Shida Fan +9 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