Results 41 to 50 of about 942,960 (263)
On the multipacking number of grid graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination where selected vertices may have different domination powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted $\gamma_b(G)$.
Laurent Beaudou, Richard C. Brewster
doaj +1 more source
Efficient generation of elimination trees and graph associahedra
ACM-SIAM Symposium on Discrete Algorithms, 2022 An elimination tree for a connected graph G is a rooted tree on the vertices of G obtained by choosing a root x and recursing on the connected components of G − x to produce the subtrees of x .
J. Cardinal +2 more
semanticscholar +1 more source
Chordal Editing is Fixed-Parameter Tractable [PDF]
, 2014 Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain property. The most commonly considered operations include vertex deletion, edge deletion, and edge addition; for the same property ...
A Hajnal +19 more
core +2 more sources
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
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
A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs [PDF]
, 2019 A locally connected spanning tree (LCST) T of a graph G is a spanning tree of G such that, for each node, its neighborhood in T induces a connected sub- graph in G.
CALAMONERI, Tiziana +2 more
core +1 more source
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
, 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
On the shelling antimatroids of split graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Chordal graph shelling antimatroids have received little attention with regard to their combinatorial properties and related optimization problems, as compared to the case of poset shelling antimatroids.
Jean Cardinal +2 more
doaj +1 more source
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