Results 51 to 60 of about 310,757 (283)

Counting Independent Sets of a Fixed Size in Graphs with Given Minimum Degree [PDF]

open access: yes, 2014
Galvin showed that for all fixed δ and sufficiently large n, the n-vertex graph with minimum degree δ that admits the most independent sets is the complete bipartite graph .
Engbers, John, Galvin, David
core   +1 more source

Vertex Degrees in Planar Maps

open access: yes, 2016
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers D. Our results rely on a classical bijection with mobiles (objects exhibiting a tree structure), combined with ...
Collet, Gwendal   +2 more
openaire   +2 more sources

Multi‐omics and low‐input proteomics profiling reveals dynamic regulation driving pluripotency initiation in early mouse embryos

open access: yesFEBS Open Bio, EarlyView.
Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li   +8 more
wiley   +1 more source

Random graphs with arbitrary degree distributions and their applications

open access: yes, 2001
Recent work on the structure of social networks and the internet has focussed attention on graphs with distributions of vertex degree that are significantly different from the Poisson degree distributions that have been widely studied in the past.
A. Broder   +46 more
core   +1 more source

UiO‐66 metal–organic frameworks in biomedicine: From structural tunability to bioimaging, photodiagnostics, and photodynamic cancer therapy

open access: yesFEBS Open Bio, EarlyView.
UiO‐66(Zr) metal–organic frameworks are chemically stable, biocompatible, and highly tunable nanomaterials. Their modular structure enables controlled drug delivery, multimodal bioimaging, and light‐activated photodynamic therapy, supporting integrated diagnostic and therapeutic (theranostic) applications in cancer and biomedical research.
Veronika Huntošová   +2 more
wiley   +1 more source

Limit distributions of maximum vertex degree in a conditional configuration graph

open access: yesTransactions of the Karelian Research Centre of the Russian Academy of Sciences, 2018
We consider configuration graphs with N vertices. The degrees of the vertices are independent identically distributed  random variables following the power-law distribution with positive parameter τ.
Irina Cheplyukova
doaj   +1 more source

Concepts of vertex regularity in cubic fuzzy graph structures with an application

open access: yesFrontiers in Physics, 2023
The cubic fuzzy graph structure, as a combination of cubic fuzzy graphs and fuzzy graph structures, shows better capabilities in solving complex problems, especially in cases where there are multiple relationships.
Li Li   +3 more
doaj   +1 more source

Further Inequalities Between Vertex-Degree-Based Topological Indices [PDF]

open access: yesInternational Journal of Applied and Computational Mathematics, 2016
9 pages and one table ...
Ali, Akbar   +2 more
openaire   +3 more sources

Functional Connectivity Linked to Cognitive Recovery After Minor Stroke

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri   +7 more
wiley   +1 more source

On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2016
Assume that $n, \delta ,k$ are integers with $0 \leq k < \delta < n$. Given a graph $G=(V,E)$ with $|V|=n$. The symbol $G-F, F \subseteq V$, denotes the graph with $V(G-F)=V-F$, and $E(G-F)$ obtained by $E$ after deleting the edges with at least one ...
Shih-Yan Chen, Shin-Shin Kao, Hsun Su
doaj   +1 more source

Home - About - Disclaimer - Privacy