Results 51 to 60 of about 946,691 (269)
Line graphs of directed graphs I [PDF]
Transactions on CombinatoricsWe 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
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
An Upper Bound for the Regularity of Symbolic Powers of Edge Ideals of Chordal Graphs
Electronic Journal of Combinatorics, 2019 Assume that $G$ is a chordal graph with edge ideal $I(G)$ and ordered matching number $\nu_{o}(G)$. For every integer $s\geq 1$, we denote the $s$-th symbolic power of $I(G)$ by $I(G)^{(s)}$.
S. Fakhari
semanticscholar +1 more source
Forbidden subgraphs in reduced power graphs of finite groups
AIMS Mathematics, 2021 Let G be a finite group. The reduced power graph of G is the undirected graph whose vertex set consists of all elements of G, and two distinct vertices x and y are adjacent if either ⟨x⟩⊂⟨y⟩ or ⟨y⟩⊂⟨x⟩. In this paper, we show that the reduced power graph
Huani Li , Ruiqin Fu, Xuanlong Ma
doaj +1 more source
, 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 +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
Token Sliding on Chordal Graphs [PDF]
International Workshop on Graph-Theoretic Concepts in Computer Science, 2016 Let I be an independent set of a graph G. Imagine that a token is located on every vertex of I. We can now move the tokens of I along the edges of the graph as long as the set of tokens still defines an independent set of G.
Marthe Bonamy, N. Bousquet
semanticscholar +1 more source
The Electronic Journal of CombinatoricsA hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the chordality of a graph $G$ to be the minimum number of chordal graphs on $V(G)$ such that the intersection of their edge sets is equal to $E(G)$.
Chaniotis, Aristotelis +2 more
openaire +2 more sources
The leafage of a chordal graph
, 1998 The leafage l(G) of a chordal graph G is the minimum number of leaves of a tree in which G has an intersection representation by subtrees. We obtain upper and lower bounds on l(G) and compute it on special classes.
Lin, In-Jen +2 more
core +3 more sources
Implementation of Drug‐Induced Rhabdomyolysis and Acute Kidney Injury in Microphysiological System
Advanced Functional Materials, EarlyView.A modular Muscle–Kidney proximal tubule‐on‐a‐chip integrates 3D skeletal muscle and renal proximal tubule tissues to model drug‐induced rhabdomyolysis and acute kidney injury. The coculture system enables dynamic tissue interaction, functional contraction monitoring, and quantification of nephrotoxicity, revealing drug side effect‐induced metabolic ...
Jaesang Kim +4 more
wiley +1 more source