Results 21 to 30 of about 327 (176)
Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
An Algorithm for Generating Strongly Chordal Graphs
CoRR, 2018 Strongly chordal graphs are a subclass of chordal graphs. The interest in this subclass stems from the fact that many problems which are NP-complete for chordal graphs are solvable in polynomial time for this subclass. However, we are not aware of any algorithm that can generate instances of this class, often necessary for testing purposes.
Md. Zamilur Rahman +2 more
openaire +2 more sources
On Strongly Chordal Graphs That Are Not Leaf Powers [PDF]
, 2017 A common task in phylogenetics is to find an evolutionary tree representing proximity relationships between species. This motivates the notion of leaf powers: a graph G = (V, E) is a leaf power if there exist a tree T on leafset V and a threshold k such that uv is an edge if and only if the distance between u and v in T is at most k.
openaire +2 more sources
Characterizations of strongly chordal graphs
Discrete Mathematics, 1983 AbstractIn this paper we present several characterizations of the class of strongly chordal graphs. These include a forbidden induced subgraph characterization and two characterizations in terms of totally balanced matrices. Another characterization yields a polynomial recognition algorithm.Interest in these graphs arises in several ways.
openaire +1 more source
Arthritis Care &Research, EarlyView.Objective Frailty occurs prematurely in rheumatoid arthritis (RA) and is associated with poor health outcomes. We compared the performance of four frailty instruments, including a pragmatic alternative measure using chair sit‐to‐stand (STS), and evaluated their abilities to predict poor health outcomes.
Kylie E. Riggles +14 more
wiley +1 more source
Advanced Healthcare Materials, EarlyView.We developed a patient‐derived, functional microfluidic model of the diffuse midline glioma (DMG) blood–brain–tumor barrier (BBTB) comprised of endothelial cells, astrocytes, pericytes, and tumor cells. The system forms perfusable microvasculature, reveals the BBTB retains vascular integrity, identifies DMG‐specific transcriptomic changes distinct from
Kimberly R. Bennett +7 more
wiley +1 more source
A characterization of chordal graph without sun and co-rising sun as convex geometry
Theory and Applications of GraphsIn this paper we introduce the notion of $t_3$ \textit{convexity}, a natural restriction of triangle convexity. A \textit{triangle path} is a path allowing just short chords. A triangle path $P$ between two non-adjacent vertices in a graph $G$ is called $
Silvia B. Tondato
doaj +1 more source
The parallel solution of domination problems on chordal and strongly chordal graphs
Discrete Applied Mathematics, 1994 This paper discusses the problem of the existence of a dominating clique in a chordal graph. The equivalence of the dominating set problem and the minimum dominating clique problem for strongly chordal graphs has also been proved. Further, it has been proved that both problems are equivalent to the cover problem viz.
Elias Dahlhaus, Peter Damaschke
openaire +1 more source
In Situ Change in Contact Angle of a Sessile Droplet on a Magnetoactive Elastomer
Advanced Materials Interfaces, EarlyView.Contact angles of persistent μL$\mu{\rm L}$‐sized water droplets on a mechanically soft MAE surface under time varying magnetic fields differ from those of newly deposited droplets. The ability to quickly alter the material properties allows one to observe intriguing droplet‐material interactions.
Raphael Kriegl +3 more
wiley +1 more source
MathematicsDomination problems are fundamental problems in graph theory with diverse applications in optimization, network design, and computational complexity.
Chuan-Min Lee
doaj +1 more source