Results 31 to 40 of about 5,057 (262)
Polyhedral properties of the induced cluster subgraphs [PDF]
Discrete Applied Mathematics, 2021 A cluster graph is a graph whose every connected component is a complete graph. Given a simple undirected graph $G$, a subset of vertices inducing a cluster graph is called an independent union of cliques (IUC), and the IUC polytope associated with $G$ is defined as the convex hull of the incidence vectors of all IUCs in the graph. The {\sc Maximum IUC}
Seyedmohammadhossein Hosseinian +1 more
openaire +3 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
Induced Subgraphs of the Power of a Cycle [PDF]
SIAM Journal on Discrete Mathematics, 1989 In this article, it is shown that if G is an induced subgraph of the dth power of a cycle of length n, and G has minimum degree $d + k$, then G has at least $[ (d + k)/2d ]n$ vertices. This answers a problem of Kezdy.
Jean-Claude Bermond, Claudine Peyrat
openaire +2 more sources
On induced subgraphs of the cube
Journal of Combinatorial Theory, Series A, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan R. K. Chung +3 more
openaire +2 more sources
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
Directed Neutrosophic Graph using Morphological Operators and Its Applications [PDF]
Neutrosophic Sets and SystemsConnectedness provides well suited solutions for several application problems. In Graph theory, graph is connected when there exist a path between any two arbitrary vertices.
Abraham Jacob +2 more
doaj +1 more source
Partitioning graphs into induced subgraphs [PDF]
Discrete Applied Mathematics, 2017 14 pages, 4 ...
openaire +2 more sources
Extending the MAX Algorithm for Maximum Independent Set
Discussiones Mathematicae Graph Theory, 2015 The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G.
Lê Ngoc C. +2 more
doaj +1 more source
Induced subgraphs with distinct sizes [PDF]
Random Structures & Algorithms, 2008 AbstractWe show that for every 0 < ϵ < 1/2, there is an n0 = n0(ϵ) such that if n > n0 then every n‐vertex graph G of size at least $\varepsilon \left( {\matrix{ {\matrix{ n \cr 2 \cr } } \cr } } \right)$ and at most $(1- \varepsilon) \left( {\matrix{ {\matrix{ n \cr 2 \cr } } \cr } } \right)$ contains induced k‐vertex subgraphs with at least ...
Noga Alon, Alexandr V. Kostochka
openaire +1 more source
NetMODE: network motif detection without Nauty. [PDF]
PLoS ONE, 2012 A motif in a network is a connected graph that occurs significantly more frequently as an induced subgraph than would be expected in a similar randomized network.
Xin Li +5 more
doaj +1 more source