Results 31 to 40 of about 63,637 (247)
Graphs in which every c edges that form a tree are chords of a common cycle
AKCE International Journal of Graphs and Combinatorics, 2020 Consider the k-connected graphs G in which every edges that form a particular type of induced subgraph must all be chords of a common cycle of G. Extending a few known partial results with and new results exploit the structure of the specified type of ...
Terry A. McKee
doaj +1 more source
Efficient Densest Subgraphs Discovery in Large Dynamic Graphs by Greedy Approximation
IEEE Access, 2023 Densest subgraph detection has become an important primitive in graph mining tasks when analyzing communities and detecting events in a wide range of application domains.
Tao Han
doaj +1 more source
Discrete Mathematics, 1992 AbstractA colored graph is a graph whose vertices have been properly, though not necessarily optimally colored, with integers. Colored graphs have a natural orientation in which edges are directed from the end point with smaller color to the end point with larger color.
William T. Trotter, Hal A. Kierstead
openaire +2 more sources
Advice Complexity of the Online Induced Subgraph Problem [PDF]
, 2015 Several well-studied graph problems aim to select a largest (or smallest) induced subgraph with a given property of the input graph. Examples of such problems include maximum independent set, maximum planar graph, and many others.
Komm, Dennis +3 more
core +2 more sources
Discrete Mathematics, 1988 AbstractIn [4] Katerinis proved the following: If G − x has a 2k-factor for each x ϵ V(G), then G has a 2k-factor.
Akira Saito +2 more
openaire +2 more sources
Efficient Enumeration of Subgraphs and Induced Subgraphs with Bounded Girth [PDF]
, 2018 The girth of a graph is the length of its shortest cycle. Due to its relevance in graph theory, network analysis and practical fields such as distributed computing, girth-related problems have been object of attention in both past and recent literature. In this paper, we consider the problem of listing connected subgraphs with bounded girth. As a large
Kurita, Kazuhiro +4 more
openaire +4 more sources
Graphs containing finite induced paths of unbounded length [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The age $\mathcal{A}(G)$ of a graph $G$ (undirected and without loops) is the collection of finite induced subgraphs of $G$, considered up to isomorphy and ordered by embeddability. It is well-quasi-ordered (wqo) for this order if it contains no infinite
Maurice Pouzet, Imed Zaguia
doaj +1 more source
Induced Subgraphs and Path Decompositions
The Electronic Journal of Combinatorics, 2023 A graph $H$ is an induced subgraph of a graph $G$ if a graph isomorphic to $H$ can be obtained from $G$ by deleting vertices. Recently, there has been significant interest in understanding the unavoidable induced subgraphs for graphs of large treewidth.
openaire +2 more sources
Reconfiguration of Regular Induced Subgraphs
, 2022 We study the problem of checking the existence of a step-by-step transformation of $d$-regular induced subgraphs in a graph, where $d \ge 0$ and each step in the transformation must follow a fixed reconfiguration rule. Our problem for $d=0$ is equivalent to \textsc{Independent Set Reconfiguration}, which is one of the most well-studied reconfiguration ...
Hiroshi Eto +4 more
openaire +2 more sources
Mitigating Molecular Aggregation in Drug Discovery With Predictive Insights From Explainable AI
Angewandte Chemie, EarlyView.In this work, MEGAN, our explainable AI model, is applied to predict small colloidally aggregating molecules (SCAMs), a significant source of false positives in drug discovery. MEGAN provides interpretable predictions and proposes structurally similar, non‐aggregating alternative molecules.
Hunter Sturm +4 more
wiley +2 more sources