Results 61 to 70 of about 26,192 (266)
Smallest cubic and quartic graphs with a given number of cutpoints and bridges
For positive integers b and c, with c even, satisfying the inequalities b+1≤c≤2b, the minimum order of a connected cubic graph with b bridges and c cutpoints is computed. Furthermore, the structure of all such smallest cubic graphs is determined.
Gary Chartrand +4 more
doaj +1 more source
Critical and Flow-Critical Snarks Coincide
Over the past twenty years, critical and bicritical snarks have been appearing in the literature in various forms and in different contexts. Two main variants of criticality of snarks have been studied: criticality with respect to the non-existence of a ...
Máčajová Edita, Škoviera Martin
doaj +1 more source
Coloring Graphs in Oriented Coloring of Cubic Graphs
AbstractOriented coloring of an oriented graph G is an arc-preserving homomorphism from G into a tournament H. We say that the graph H is universal for a family of oriented graphs $$\mathcal {C}$$ C if for every $$G\in \mathcal {C}$$ G ∈ C
openaire +2 more sources
Cuttlebone‐inspired metamaterials exploit a septum‐wall architecture to achieve excellent mechanical and functional properties. This review classifies existing designs into direct biomimetic, honeycomb‐type, and strut‐type architectures, summarizes governing design principles, and presents a decoupled design framework for interpreting multiphysical ...
Xinwei Li, Zhendong Li
wiley +1 more source
Dispensing Volumetric Additive Manufacturing
Dispensing volumetric additive manufacturing (DVAM) prints 3D structures inside a photocurable resin droplet suspended from the tip of a glass pipette, enabling sequential printing without resin vats or manual part removal. Real‐time droplet profiling and ray‐tracing‐based correction compensate for optical distortion at the curved resin‐air interface ...
Hongryung Jeon +5 more
wiley +1 more source
ON THE EDGE COVER POLYNOMIAL OF CERTAIN GRAPHS [PDF]
Let $G$ be a simple graph of order $n$ and size $m$.The edge covering of $G$ is a set of edges such that every vertex of $G$ is incident to at least one edge of the set.
Saeid Alikhani, Sommayeh Jahari
doaj +1 more source
Magnetic Ion Channel Activation (MICA) enables remote stimulation of mechanosensitive ion channels using functionalised magnetic nanoparticles, enhancing extracellular vesicle (EV) biogenesis is pre‐osteoblasts. MICA desrived EVs exhibit typical nano‐vesicular characteristics but display superior pro‐osteogeneic activity, promoting mesenchymal stem ...
Afeesh Rajan Unnithan +9 more
wiley +1 more source
We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which improves the previously best approximation factor of 1.3 for 2-connected cubic graphs and drops the requirement of 2-connectivity at the same time. To design our algorithm, we prove that every simple 2-connected cubic n-vertex graph contains a spanning ...
Dvorák, Zdenek +2 more
openaire +4 more sources
Over half of cancer patients undergo radiotherapy. Laser ablation enabled the synthesis of immiscible Au‐Fe‐B nanoparticles designed as degradable bimodal radiosensitizers for X‐ray radiotherapy (XRT), boron neutron capture therapy (BNCT), and bimodal imaging for X‐ray computed tomography (CT) and magnetic resonance imaging (MRI). These nanosensitizers
Michael Bissoli +15 more
wiley +1 more source
Similarly to Wiener index, hyper-Wiener index of a connected graph is a widely applied topological index measuring the compactness of the structure described by the given graph. Hyper-Wiener index is the sum of the distances plus the squares of distances
Mujahed Hamzeh, Nagy Benedek
doaj +1 more source

