Results 41 to 50 of about 174,518,636 (296)
Crown reductions for the Minimum Weighted Vertex Cover problem [PDF]
, 2004 The paper studies crown reductions for the Minimum Weighted Vertex Cover problem introduced recently in the unweighted case by Fellows et al. [Blow-Ups, Win/Win's and crown rules: some new directions in FPT, in: Proceedings of the 29th International ...
Chlebikova, Janka +5 more
core +1 more source
Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
Complexity, 2021 Let G be a connected graph with minimum degree δG and vertex-connectivity κG. The graph G is k-connected if κG≥k, maximally connected if κG=δG, and super-connected if every minimum vertex-cut isolates a vertex of minimum degree. In this paper, we present
Zhen-Mu Hong +3 more
doaj +1 more source
Vertex-centric communities on degree-1 vertices.
, 2017 We do not calculate extended vertex-centric communities for seed vertices of degree equal to 1. However, they may be included in extended communities centered on other vertices.
Yiannis Kompatsiaris (3826402) +2 more
core +1 more source
Vertex and edge covers with clustering properties: complexity and algorithms [PDF]
, 2009 We consider the concepts of a t-total vertex cover and a t-total edge cover (t≥1), which generalise the notions of a vertex cover and an edge cover, respectively.
Fernau, H., Manlove, D.F.
core +1 more source
Graph Realizations: Maximum Degree in Vertex Neighborhoods [PDF]
, 2020 The classical problem of degree sequence realizability asks whether or not a given sequence of n positive integers is equal to the degree sequence of some n-vertex undirected simple graph. While the realizability problem of degree sequences has been well
Rawitz, Dror +3 more
core +1 more source
Random Graphs' Robustness in Random Environment
Austrian Journal of Statistics, 2017 We consider configuration graphs the vertex degrees of which are independent and follow the power-law distribution. Random graphs dynamics takes place in a random environment with the parameter of vertex degree distribution following uniform ...
Marina Leri, Yury Pavlov
doaj +1 more source
A Golden Ratio Inequality for Vertex Degrees of Graphs [PDF]
The American Mathematical Monthly, 2019 Motivated by the study of the crossing number of graphs, it is shown that, for trees, the sum of the products of the degrees of the end-vertices of all edges has an upper bound in terms of the sum of all vertex degrees to the power of $ϕ^2$, where $ϕ$ is the golden ratio. The exponent $ϕ^2$ is best possible.
Fiachra Knox, Bojan Mohar, David R. Wood
openaire +2 more sources
Structure‐forward targeting of claudins with synthetic binders
FEBS Letters, EarlyView.Claudins form the paracellular barriers between epithelial and endothelial tissues at tight junctions and are targets for molecular binders with the goal of modulating barrier permeability. Claudin‐binding molecules are relevant in drug delivery or in altering claudin interactions with disease‐causing proteins.
Alex J. Vecchio
wiley +1 more source
Liver organoids: modelling complexity in homeostasis and disease
FEBS Letters, EarlyView.Studying liver in vitro has been challenging because simple 2D cell cultures fail to capture liver's cellular and architectural complexity. To bridge this gap, scientists increasingly use organoids, 3D liver models which better mimic liver composition and function. This review examines recent advances in liver organoid complexity and realism, discusses
Anna M. Dowbaj, Meritxell Huch
wiley +1 more source
Bijective Enumeration of Bicolored Maps of Given Vertex Degree Distribution [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We derive a new formula for the number of factorizations of a full cycle into an ordered product of two permutations of given cycle types. For the first time, a purely combinatorial argument involving a bijective description of bicolored maps of ...
Alejandro Morales, Ekaterina Vassilieva
doaj +1 more source