Results 41 to 50 of about 756 (218)
Transitivity on Subclasses of Chordal Graphs
, 2023 Let $G=(V, E)$ be a graph, where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$ \textit{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$ in $G$. A vertex partition $π= \{V_1, V_2, \ldots, V_k\}$ of $G$ is called a \emph{transitive $k$-partition} if $V_i ...
Subhabrata Paul, Kamal Santra
openaire +2 more sources
Graph Decompositions and Factorizing Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 A factorizing permutation of a given graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here for
Christian Capelle +2 more
doaj +3 more sources
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
Journal of Graph Algorithms and Applications, 2012 We introduce a notion of simultaneity for any class of graphs with an intersection representation (interval graphs, chordal graphs, etc.) and for comparability graphs, which are represented by transitive orientations.
Krishnam Raju Jampani, Anna Lubiw
doaj +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
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +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
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A graph $G$ is {\em matching-decyclable} if it has a matching $M$ such that $G-M$ is acyclic. Deciding whether $G$ is matching-decyclable is an NP-complete problem even if $G$ is 2-connected, planar, and subcubic.
Fábio Protti, Uéverton S. Souza
doaj +1 more source
Chordal multipartite graphs and chordal colorings
Discrete Mathematics, 2007 A graph is defined to be chordal colorable if it admits a proper vertex-coloring such that each minimal separator induces a subgraph in which two vertices are adjacent if and only if they are differently colored. All chordal graphs and all chordal bipartite graphs are chordal colorable. All chordal colorable graphs are weakly chordal.
openaire +1 more source
Discrete Applied Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uri N. Peled, Udi Rotics
openaire +1 more source