Results 81 to 90 of about 43,364 (297)
, 1986 We present a generalization of the notion of perfect codes: perfect codes over graphs. We show an infinite family of 1-perfect codes in second powers of graphs and we prove the nonexistence of nontrivial 1-perfect codes over complete bipartite graphs ...
Kratochvíl, Jan
core +1 more source
Square-free perfect graphs [PDF]
, 2004 We prove that square-free perfect graphs are bipartite graphs or line graphs of bipartite graphs or have a 2-join or a star ...
CONFORTI, MICHELANGELO +11 more
core +1 more source
Spin‐Split Edge States in Metal‐Supported Graphene Nanoislands Obtained by CVD
Advanced Materials, EarlyView.Combining STM measurements and ab‐initio calculations, we show that zig‐zag edges in graphene nanoislands grown on Ni(111) by CVD retrieve their spin‐polarized edge states after intercalation of a few monolayers of Au. ABSTRACT Spin‐split states localized on zigzag edges have been predicted for different free‐standing graphene nanostructures.
Michele Gastaldo +6 more
wiley +1 more source
Mechanically Programmable DNA Hydrogel Microparticles for 3D Cellular Systems
Advanced Materials, EarlyView.DNA hydrogel microparticles are designed to exhibit controllable viscoelasticity and stiffness across three orders of magnitude from 30Pa$30 \,\mathrm{Pa}$ to 6.5kPa$6.5 \,\mathrm{kPa}$. They are uptaken into fibroblast spheroids where they are actively remodeled by cellular forces depending on their mechanical properties.
Tobias Walther +9 more
wiley +1 more source
Perfect Roman and Perfect Italian Domination of Cartesian Product Graphs
Scientific Journal of King Faisal University: Basic and Applied SciencesFor a graph G=(V,E), a function f:V→{0,1,2} is a perfect Roman dominating function (PRDF) on G if every v∈V with f(v)=0 is adjacent to exactly one vertex u with f(u)=2. The sum ∑_(v∈V)^▒f (v) is the weight w(f) of f.
Ahlam Almulhim
doaj +1 more source
Rainbow perfect domination in lattice graphs
Electronic Journal of Graph Theory and Applications, 2018 Let 0 < n ∈ Z. In the unit distance graph of Zn ⊂ Rn, a perfect dominating set is understood as having induced components not necessarily trivial.
Luis R. Fuentes +2 more
doaj +1 more source
Inverse Design of Amorphous Materials With Targeted Properties
Advanced Materials, EarlyView.AMDEN is a diffusion model framework for the inverse design of amorphous materials with targeted properties. By incorporating Hamiltonian Monte Carlo refinement into the denoising process, the framework overcomes the challenge of generating thermally relaxed disordered structures.
Jonas A. Finkler +4 more
wiley +1 more source
Integral sum graphs Gn and G-r,n are perfect graphs
AKCE International Journal of Graphs and CombinatoricsA graph G is an integral sum graph (sum graph) if its vertices can be labeled with distinct integers (positive integers) so that e = uv is an edge of G if and only if the sum of the labels on vertices u and v is also a label in G. A graph G is perfect if
Julia K. Abraham +4 more
doaj +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
Discrete Mathematics, 1995 Let \(G\) be a graph. A set \(X\) of vertices of \(G\) is said to be a dominating set of vertices of \(G\) if \(V(G)\) is contained in the closed neighbourhood of \(X\). The smallest cardinality of a dominating set of vertices in \(G\) is called the domination number of \(G\) and is denoted by \(\gamma(G)\). Let \(X\) be a set of vertices of \(G\).
openaire +1 more source