Results 51 to 60 of about 3,864 (298)
Partitioning 3-colored complete graphs into three monochromatic cycles [PDF]
, 2011 We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core
Chiral Phase Change Nanomaterials
Advanced Functional Materials, EarlyView.This work demonstrates reversible, non‐volatile phase transitions in chiral Ge2${\rm Ge}_2$Sb2${\rm Sb}_2$Te5${\rm Te}_5$ (GST) nanohelices for high‐speed optical modulation of chirality and dynamic control of the state of polarization (SOP). The chiral nanostructures are fabricated using a highly directional, wafer‐scale physical vapor deposition ...
Joshua A. Burrow +11 more
wiley +1 more source
Vertex Set Partitions Preserving Conservativeness [PDF]
, 1997 Let G be an undirected graph and P = fX 1 ; : : : ; X n g be a partition of V (G). Denote by G/P the graph which has vertex set fX 1 ; : : : ; X n g, edge set E, and is obtained from G by identifying vertices in each class X i of the partition P. Given a
A. A. Ageev, A. V. Kostochka
core
Perfect 3-colorings of the cubic graphs of order 10
Electronic Journal of Graph Theory and Applications, 2017 Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect m-coloring of a graph G with m colors is a partition of the vertex set of G into m parts A_1, A_2, ..., A_m such that, for all $ i,j \in \lbrace ...
Mehdi Alaeiyan, Ayoob Mehrabani
doaj +1 more source
On Compatible Normal Odd Partitions in Cubic Graphs [PDF]
, 2013 International audienceA normal odd partition T of the edges of a cubic graph is a partition into trails of odd length (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition and internal in some trail.
Fouquet, Jean-Luc, Vanherpe, Jean-Marie
core +1 more source
Vertex partitioning and p-energy of graphs
Linear Algebra and its ApplicationsFor a Hermitian matrix $A$ of order $n$ with eigenvalues $λ_1(A)\ge \cdots\ge λ_n(A)$, define \[ \mathcal{E}_p^+(A)=\sum_{λ_i > 0} λ_i^p(A), \quad \mathcal{E}_p^-(A)=\sum_{λ_i<0} |λ_i(A)|^p,\] to be the positive and the negative $p$-energy of $A$, respectively.
Akbari, Saieed +3 more
openaire +3 more sources
Advanced Functional Materials, EarlyView.Ferroelectric nanoclusters create local internal fields in a normally non‐switchable polar film because of polarization mismatch at their interfaces. That field opposes polarization in the regions with larger polarization and reinforces polarization in the regions with smaller polarization.
Anna N. Morozovska +5 more
wiley +1 more source
Uniform and most uniform partitions of trees [PDF]
, 2018 This paper addresses centered and non centered equipartition tree problems into connected components (p-partitions). In the former case, each partition must contain exactly one special vertex called center, whereas in the latter, partitions are not ...
Federica Ricca +3 more
core +1 more source
Cauchy formula and the character ring
European Physical Journal C: Particles and Fields, 2019 Cauchy summation formula plays a central role in application of character calculus to many problems, from AGT-implied Nekrasov decomposition of conformal blocks to topological-vertex decompositions of link invariants.
A. Morozov
doaj +1 more source
Advanced Functional Materials, EarlyView.ABSTRACT Next‐generation implantable neural‐interfacing devices are increasingly constrained by the coupled demands of electrode miniaturization, electrochemical performance, and implantation infection risk. Femtosecond laser–based hierarchical surface restructuring (HSR) technology has emerged as a scalable, manufacturing‐compatible platform for ...
Henna Khosla +12 more
wiley +1 more source