Results 201 to 210 of about 5,978,611 (274)

The 1 3 $\frac{1}{3}$‐Conjectures for Domination in Cubic Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT A set S $S$ of vertices in a graph G $G$ is a dominating set of G $G$ if every vertex not in S $S$ is adjacent to a vertex in S $S$. The domination number of G $G$, denoted by γ ( G ) $\gamma (G)$, is the minimum cardinality among all dominating sets in G $G$. In a breakthrough paper in 2008, Löwenstein and Rautenbach proved that if G $G$ is a
Paul Dorbec, Michael A. Henning
wiley   +1 more source

QSPR modelling of PPI drugs using hybrid topological indices. [PDF]

Front Chem
Monisha L, Jayagopal R.
europepmc   +1 more source

The Minimal Nonplanar Strong Digraphs

Journal of Graph Theory, EarlyView.
ABSTRACT Kuratowski's theorem says that the minimal (under subgraph containment) graphs that are not planar are the subdivisions of K 5 ${K}_{5}$ and of K 3 , 3 ${K}_{3,3}$. Here we study the minimal (under subdigraph containment) strongly‐connected digraphs that are not planar.
Stephen Bartell, Paul Seymour
wiley   +1 more source

Minimum Vertex Cut with Reachable Set (MVCRS) Problem for Suppressing Botnet Propagation in IoT Networks: Complexity and Algorithms. [PDF]

Sensors (Basel)
Yamaguchi S.
europepmc   +1 more source

Flow‐Critical Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT Lovász et al. proved that every six‐edge‐connected graph has a nowhere‐zero three‐flow. In fact, they proved a more technical statement, which says that there exists a nowhere‐zero three‐flow that extends the flow prescribed on the incident edges of a single vertex z $z$ with bounded degree. We extend this theorem of Lovász et al.
Arnbjörg Soffía Árnadóttir, Zdeněk Dvořák, Bernard Lidický, Benjamin Moore, Evelyne Smith‐Roberge, Robert Šámal   +5 more
wiley   +1 more source

Recognizing distance-count matrices. [PDF]

PLoS One
Boldi P, Prezioso C, Furia F, Stewart I.
europepmc   +1 more source

From Finding a Spanning Subgraph H $H$ to an H $H$‐Factor

Journal of Graph Theory, EarlyView.
ABSTRACT A typical Dirac‐type problem in extremal graph theory is to determine the minimum degree threshold for a graph G $G$ to have a spanning subgraph H $H$, for example, the Dirac theorem. A natural follow‐up problem is to seek an H $H$‐factor, which is a spanning set of vertex‐disjoint copies of H $H$.
Allan Lo
wiley   +1 more source

Customized dimetric dimension method for optimized attribute reduction with applications in uncertain clinical information systems^. [PDF]

MethodsX
Anitha K, Arunadevi R, Suganya E, Sountharrajan S.   +3 more
europepmc   +1 more source

Dasatinib and quercetin prevent alveolar bone loss in aged mice

Journal of Periodontology, EarlyView.
Abstract Background Recent findings have associated alveolar bone loss (ABL) with the presence of senescent cells. Aging and the accumulation of senescent cells are associated with a pro‐inflammatory environment which may exacerbate tissue damage.
Luisa S. Battistelli, Renata M. Moraes, Yuri C. Santos, Jaqueline L. Ribeiro, Maíra T. Garcia, Renata F. Prado, Florent Elefteriou, Ana Lia Anbinder   +7 more
wiley   +1 more source

Image contraction through fuzzy soft outerplanar graph structures. [PDF]

Sci Rep
Jaisankar D, Ramalingam S, Zegeye GB.
europepmc   +1 more source