Results 21 to 30 of about 63,637 (247)
On subgraphs without large components [PDF]
Mathematica Bohemica, 2017 We consider, for a positive integer $k$, induced subgraphs in which each component has order at most $k$. Such a subgraph is said to be $k$-divided. We show that finding large induced subgraphs with this property is NP-complete.
Glenn G. Chappell, John Gimbel
doaj +1 more source
Reconfiguring spanning and induced subgraphs [PDF]
Theoretical Computer Science, 2018 Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure property. Although there has been previous work that can be categorized as subgraph reconfiguration, most of the ...
Tesshu Hanaka +7 more
openaire +5 more sources
Induced subgraphs of Johnson graphs [PDF]
Involve, a Journal of Mathematics, 2012 12 pages, 4 ...
Naimi, Ramin, Shaw, Jeffrey
openaire +3 more sources
Induced subgraph and eigenvalues of some signed graphs
AKCE International Journal of Graphs and Combinatorics, 2022 Hao Huang proved the Sensitivity Conjecture in [Induced graphs of the hypercube and a proof of the Sensitivity Conjecture, Annals of Mathematics, 190 (2019), 949-955] by signed graph spectral method.
Fu-Tao Hu, Mei-Yu Sun
doaj +1 more source
Groups for which the noncommuting graph is a split graph [PDF]
International Journal of Group Theory, 2017 The noncommuting graph $nabla (G)$ of a group $G$ is a simple graph whose vertex set is the set of noncentral elements of $G$ and the edges of which are the ones connecting two noncommuting elements. We determine here, up to isomorphism, the structure of
Marzieh Akbari, Alireza Moghaddamfar
doaj +1 more source
Optimal subgraph structures in scale-free configuration models [PDF]
, 2020 Subgraphs reveal information about the geometry and functionalities of complex networks. For scale-free networks with unbounded degree fluctuations, we obtain the asymptotics of the number of times a small connected graph occurs as a subgraph or as an ...
Stegehuis, Clara +2 more
core +3 more sources
Partitioning graphs into induced subgraphs [PDF]
Discrete Applied Mathematics, 2017 Comment: 14 pages, 4 ...
Dušan Knop, Dušan Knop
openaire +4 more sources
Long Circuits and Large Euler Subgraphs [PDF]
, 2013 An undirected graph is Eulerian if it is connected and all its vertices are of even degree. Similarly, a directed graph is Eulerian, if for each vertex its in-degree is equal to its out-degree.
A. Golovach, Fedor V. Fomin, Petr
core +1 more source
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
On Minimal Unique Induced Subgraph Queries
Applied Sciences, 2018 In this paper, a novel type of interesting subgraph query is proposed: Minimal Unique Induced Subgraph (MUIS) query. Given a (large) graph G and a query vertex (position) q in the graph, can we find an induced subgraph containing q with the minimal ...
Lincheng Jiang +6 more
doaj +1 more source