Results 121 to 130 of about 908,928 (292)

Face Sizes and the Connectivity of the Dual

Journal of Graph Theory, EarlyView.
ABSTRACT For each c≥1 $c\ge 1$, we prove tight lower bounds on face sizes that must be present to allow 1‐ or 2‐cuts in simple duals of c $c$‐connected maps. Using these bounds, we determine the smallest genus on which a c $c$‐connected map can have a simple dual with a 2‐cut and give lower and some upper bounds for the smallest genus on which a c $c ...
Gunnar Brinkmann, Kenta Noguchi, Heidi Van den Camp   +2 more
wiley   +1 more source

Dose‐dependent association of systemic comorbidities with periodontitis severity: A large population cross‐sectional study

Journal of Periodontology, EarlyView.
Abstract Background To examine whether the associations between periodontitis and multiple systemic conditions increase with increasing severity of periodontitis using a multi‐center electronic health record (EHR) repository. Methods A cross‐sectional analysis was conducted using EHR data from 9 dental schools in the United States.
Muhammad H. A. Saleh, Hamoun Sabri
wiley   +1 more source

Feedback vertex set on chordal bipartite graphs [PDF]

Let G=(A,B,E) be a bipartite graph with color classes A and B. The graph G is chordal bipartite if G has no induced cycle of length more than four. Let G=(V,E) be a graph. A feedback vertex set F is a set of vertices F subset V such that G-F is a forest.
Kloks, Ton, Liu, Ching-Hao, Poon, Sheung-Hung   +2 more
core  

Spatial verification of global precipitation forecasts

Quarterly Journal of the Royal Meteorological Society, EarlyView.
We present an adaptation of the recently developed precipitation attribution distance (PAD) metric, designed for verifying precipitation, enabling its use on the Earth's spherical geometry. The method is fast and flexible, with its behavior analyzed using a set of idealized cases and 7 years of operational global high‐resolution precipitation forecasts.
Gregor Skok, Llorenç Lledó
wiley   +1 more source

Chordality Properties and Hyperbolicity on Graphs

The Electronic Journal of Combinatorics, 2016
Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if every induced cycle has at most three edges.
openaire   +3 more sources

Sonified Signals From a Compact FT‐ICR Instrument: A Feasibility Study. I—Data Mapping to an Equal‐Tempered Chromatic Scale

Rapid Communications in Mass Spectrometry, EarlyView.
ABSTRACT Rationale Ions trapped within a Penning cell (ICR) travel periodic orbits whose frequencies are dependent on their mass‐to‐charge ratio and the value of the magnetic field passing through the trap. Fourier transformation (FT‐ICR) decomposes the signal induced in the detection circuit by the rotation of the ions in the cell after the ...
Patrick Arpino, Michel Heninger
wiley   +1 more source

New graph classes characterized by weak vertex separators and two-pairs

AKCE International Journal of Graphs and Combinatorics, 2017
A set of vertices whose deletion from a graph would increase the distance between two remaining vertices is called a weak vertex separator of the graph. Two vertices form a two-pair if all chordless paths between them have length .
Terry A. McKee
doaj   +1 more source

Leveraging the Power of Images: Image Recommendation to Enhance Issue Reports

Software: Practice and Experience, EarlyView.
ABSTRACT Background The trend of sharing images and image‐based social networks has eventually changed the landscape of social networks. Objective This study focuses on three primary objectives: (i) identifying issue reports that benefit from image sharing and processing in Bugzilla, (ii) identifying the type of image that would improve the bug report,
Xuchen Tan, Deenu Gengiti, Maleknaz Nayebi   +2 more
wiley   +1 more source

Forbidden subgraphs of TI-power graphs of finite groups

Open Mathematics
Given a finite group GG with identity ee, the TI-power graph (trivial intersection power graph) defined on GG, denoted by Γ(G)\Gamma \left(G), is an undirected graph with vertex set GG where distinct vertices aa and bb are adjacent if ⟨a⟩∩⟨b⟩={e}\langle ...
Li Huani, Chen Jin, Lin Shixun
doaj   +1 more source

Connected graph searching in chordal graphs

Discrete Applied Mathematics, 2009
Graph searching was introduced by Parson [T. Parson, Pursuit-evasion in a graph, in: Theory and Applications of Graphs, in: Lecture Notes in Mathematics, Springer-Verlag, 1976, pp. 426--441]: given a “contaminated†graph G (e.g., a network containing a hostile intruder), the search number View the MathML source of the graph G is the minimum number ...
openaire   +2 more sources