Results 81 to 90 of about 196,583,728 (297)
Influence of the average vertex degree.
, 2016 Connection between average vertex degree of a state graph and its total mixing time, respectively canonical path bound.
Steffen Rechner (2174908) +1 more
core +1 more source
Degree-penalized contact processes
Forum of Mathematics, SigmaIn this paper we study degree-penalized contact processes on Galton-Watson (GW) trees and the configuration model. The model we consider is a modification of the usual contact process on a graph.
Zsolt Bartha +2 more
doaj +1 more source
On Conditional Connectivity of the Cartesian Product of Cycles
Discussiones Mathematicae Graph Theory, 2023 The conditional h-vertex (h-edge) connectivity of a connected graph H of minimum degree k > h is the size of a smallest vertex (edge) set F of H such that H − F is a disconnected graph of minimum degree at least h. Let G be the Cartesian product of r ≥ 1
Saraf J.B., Borse Y.M., Mundhe Ganesh
doaj +1 more source
On Bounded-Degree Vertex Deletion parameterized by treewidth
Discrete Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nadja Betzler +3 more
openaire +2 more sources
The Effect of Hydrophilic Headgroup Chemistry on Peptoid‐Directed Mineralization of CaCO3
Advanced Functional Materials, EarlyView.Amphiphilic peptoids alter the pathway and outcome of calcium carbonate crystallization, which progresses through amorphous calcium carbonate (ACC) to vaterite to calcite rhombs in the absence of peptoids. In contrast, amine‐terminated peptoids produce vaterite disks and carboxyl‐terminated peptoids produce calcite mesocrystals.
Biao Jin +5 more
wiley +1 more source
On structural parameterizations of the bounded-degree vertex deletion problem [PDF]
, 2020 We study the parameterized complexity of the Bounded-Degree Vertex Deletion problem (BDD), where the aim is to find a maximum induced subgraph whose maximum degree is below a given degree bound.
Ordyniak, Sebastian +11 more
core +1 more source
On the Trees With Maximal Augmented Zagreb Index
IEEE Access, 2018 The augmented Zagreb index (AZI), a variant of the well-known atom-bond connectivity (ABC) index, was shown to have the best predicting ability for a variety of physicochemical properties among several tested vertex-degree-based topological indices ...
Wenshui Lin +4 more
doaj +1 more source
Some Bond Incident Degree Indices of (Molecular) Graphs with Fixed Order and Number of Cut Vertices
Discrete Dynamics in Nature and Society, 2021 A bond incident degree (BID) index of a graph G is defined as ∑uv∈EGfdGu,dGv, where dGw denotes the degree of a vertex w of G, EG is the edge set of G, and f is a real-valued symmetric function. The choice fdGu,dGv=adGu+adGv in the aforementioned formula
Abeer M. Albalahi +3 more
doaj +1 more source
Bounding the feedback vertex number of digraphs in terms of vertex degrees
Discrete Applied Mathematics, 2011 The Turan bound is a famous result in graph theory, which relates the independence number of an undirected graph to its edge density. Also the Caro-Wei inequality, which gives a more refined bound in terms of the vertex degree sequence of a graph, might be regarded today as a classical result. We show how these statements can be generalized to directed
openaire +5 more sources
Critical Coupling in Semi‐Trasparent Fano Resonators for Photothermal Converters
Advanced Functional Materials, EarlyView.An ultrathin metal–insulator multilayer architecture is engineered to exploit Fano‐resonant critical coupling, completely suppressing optical reflectance while achieving a balanced 50:50 trade‐off between absorbance and transmittance. Upon laser excitation at resonance, the metamaterial generates intense localized heat (ΔT≈550∘C$\Delta T {\approx }550^\
Giuseppe Emanuele Lio +3 more
wiley +1 more source