Results 41 to 50 of about 11,796 (253)

Representations of Edge Intersection Graphs of Paths in a Tree [PDF]

Discrete Mathematics & Theoretical Computer Science, 2005
Let $\mathcal{P}$ be a collection of nontrivial simple paths in a tree $T$. The edge intersection graph of $\mathcal{P}$, denoted by EPT($\mathcal{P}$), has vertex set that corresponds to the members of $\mathcal{P}$, and two vertices are joined by an ...
Martin Charles Golumbic, Marina Lipshteyn, Michal Stern   +2 more
doaj   +1 more source

The square of a chordal graph

Discrete Mathematics, 1994
The authors characterize those multigraphs which are squares of chordal graphs and develop an algorithm for producing the unique square root from its squared chordal graph.
Frank Harary, Terry A. McKee
openaire   +1 more source

Line graphs of directed graphs I [PDF]

Transactions on Combinatorics
We determine the forbidden induced subgraphs for the intersection of the classes of chordal bipartite graphs and line graphs of acyclic directed graphs. This is a first step towards finding the forbidden induced subgraphs for the class of line graphs of ...
Vaidyanathan Sivaraman, Daniel Slilaty
doaj   +1 more source

Generating subgraphs in chordal graphs

Discrete Applied Mathematics, 2023
13 pages, 1 figure.
Vadim E. Levit, David Tankus
openaire   +2 more sources

Linear time determination of the scattering number for strictly chordal graphs [PDF]

, 2021
Lilian Markenzon, Christina F. E. M. Waga   +1 more
openalex   +2 more sources

A New Characterization of Unichord-Free Graphs

Discussiones Mathematicae Graph Theory, 2015
Unichord-free graphs are defined as having no cycle with a unique chord. They have appeared in several papers recently and are also characterized by minimal separators always inducing edgeless subgraphs (in contrast to characterizing chordal graphs by ...
McKee Terry A.
doaj   +1 more source

Koszul binomial edge ideals

, 2013
It is shown that if the binomial edge ideal of a graph $G$ defines a Koszul algebra, then $G$ must be chordal and claw free.
A. Conca, A. Rauf, G.A. Dirac, H. Ohsugi, H. Ohsugi, J. Backelin, J. Herzog, J. Tate, J.E. Roos, K. Matsuda, L.L. Avramov, L.L. Avramov, M. Crupi, M. Ohtani, T.H. Gulliksen, V. Ene, V. Ene   +16 more
core   +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

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

Evaluating a Pragmatic Strength Alternative for Frailty Measurement and Assessing Its Predictive Capacity Against Established Frailty Instruments in Rheumatoid Arthritis

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, Hannah F. Brubeck, Adrienne D. Tanus, Courtney N. Loecker, Punyasha Roul, Bryant R. England, Elizabeth R. Wahl, James S. Andrews, Namrata Singh, Joshua F. Baker, Patricia P. Katz, Dolores M. Shoback, Jose M. Garcia, Ariela R. Orkaby, Katherine D. Wysham   +14 more
wiley   +1 more source