Results 61 to 70 of about 3,844 (297)
Distinguishing Number and Distinguishing Index of the Join of Two Graphs [PDF]
The distinguishing number (index) D(G) (D'(G)) of a graph G is the least integer d such that G has an vertex labeling (edge labeling) with d labels that is preserved only by a trivial automorphism. In this paper we study the distinguishing number and the
Saeid Alikhani, Samaneh Soltani
doaj +1 more source
Vertex partitioning and p-energy of graphs
For 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
Influence of Geometric Design on Mechanical Performance of Auxetic Metastructure
Strategic geometric reinforcement transforms auxetic performance. This study evaluates 3D‐printed arrowhead metastructures, revealing that a modified design with local ring reinforcement suppresses premature failure to achieve superior energy absorption and structural efficiency.
Muhammad Gulzari +3 more
wiley +1 more source
This paper presents a digital microfluidics‐based technique for transferring and reconfiguring soft nanomembranes. Laser‐machined nanothin membranes are picked up, transported, and aligned via tailored surface tension and the actuation of water droplets, enabling the development of flexible electronics, the integration of functional materials on 3D ...
Quang Anh Nguyen +15 more
wiley +1 more source
For each rational number q=b/c where b≥c are positive integers, we define a q-brick of G to be a maximal subgraph H of G such that cH has b edge-disjoint spanning trees, and a q-superbrick of G to be a maximal subgraph H of G such that cH−e has b edge ...
Jackson, Bill, Jordán, Tibor
core +1 more source
Chiral Phase Change Nanomaterials
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 partition of hypergraphs and maximum degenerate subhypergraphs
In 2007 Matamala proved that if G is a simple graph with maximum degree Δ ≥ 3 not containing KΔ+1 as a subgraph and s, t are positive integers such that s+t ≥ Δ, then the vertex set of G admits a partition (S,T) such that G[S] is a maximum order (s-1 ...
Thomas Schweser, Michael Stiebitz
doaj +1 more source
Vertex partitioning of a class of digraphs [PDF]
A vertex subset V' of a digraph is a pseudo sink set if its out-degree is low. The research of a pseudo sink set in a digraph is a high complexity combinatory problem. We show, for a particular family of digraphs, that a clustering of the vertex set fitted with a well chosen metric allows to reveal pseudo sink sets by their aggregation in a first ...
Louis Ferre, Bertrand Jouve
openaire +1 more source
This study demonstrates that ALY688, a drug mimicking the heart‐protective hormone adiponectin, reduces myocardial ischemia injury. ALY688 increases the production of extracellular vesicles, which carry protective cargo including adiponectin itself.
Jialing Tang +13 more
wiley +1 more source
This paper considers the stable set and coloring problems of hypergraphs and presents several new results and algorithms using the semitensor product of matrices. By the definitions of an incidence matrix of a hypergraph and characteristic logical vector
Min Meng, Jun-e Feng
doaj +1 more source

