Results 1 to 10 of about 8,313 (308)
Induced Subgraph Saturated Graphs
Theory and Applications of Graphs, 2016 A graph $G$ is said to be \emph{$H$-saturated} if $G$ contains no subgraph isomorphic to $H$ but the addition of any edge between non-adjacent vertices in $G$ creates one.
Craig Tennenhouse
doaj +4 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 +4 more sources
The largest subgraph without a forbidden induced subgraph [PDF]
CombinatoricaWe initiate the systematic study of the following Tur\'an-type question. Suppose $\Gamma$ is a graph with $n$ vertices such that the edge density between any pair of subsets of vertices of size at least $t$ is at most $1 - c$, for some $t$ and $c > 0 ...
Pham, Huy Tuan +2 more
core +3 more sources
Eigenvalue Conditions for Induced Subgraphs
Discussiones Mathematicae Graph Theory, 2015 Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving the smallest ordinary or the largest normalized Laplacian eigenvalue of G are presented.
Harant Jochen +2 more
doaj +3 more sources
Detecting induced subgraphs [PDF]
Discrete Applied Mathematics, 2007 An s-graph is a graph with two kinds of edges : subdivisible edges and real edges. A realisation of an s-graphB is any graph obtained by subdividing subdivisible edges of B into paths of arbitrary length (at least one).
Nicolas Trotignon +3 more
core +8 more sources
Maximum induced subgraph of a recursive circulant
Information Processing Letters, 2005 The recursive circulant RC(2(n), 4) enjoys several attractive topological properties. Let max_epsilon(G) (m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. In this paper, we show that max_epsilon(RC(2n,4))(m) = Sigma(i)(r)
Xiaofan Yang, Graham M Megson
exaly +2 more sources
A semi-induced subgraph characterization of upper domination perfect graphs [PDF]
Journal of Graph Theory, 1999 Let β(G) and Γ(G) be the independence number and the upper domination number of a graph G, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. The class of Γ-perfect graphs generalizes such well-known classes of
Igor E Zverovich
exaly +1 more source
Polyhedral results for the bipartite induced subgraph problem
Discrete Applied Mathematics, 2006 Given a graph G=(V,E) with node weights, the Bipartite Induced Subgraph Problem (BISP) is to find a maximum weight subset of nodes V′ of G such that the subgraph induced by V′ is bipartite.
Pierre Fouilhoux, A Ridha Mahjoub
exaly +2 more sources
Induced subgraph isomorphism: Are some patterns substantially easier than others?
Theoretical Computer Science, 2015 The complexity of the subgraph isomorphism problem where the pattern graph is of fixed size is well known to depend on the topology of the pattern graph.
MIROSŁAW Kowaluk +2 more
exaly +2 more sources
The Maximum Induced Bipartite Subgraph Problem with Edge Weights
SIAM Journal on Discrete Mathematics, 2007 Given a graph $G=(V,E)$ with nonnegative weights on the edges, the maximum induced bipartite subgraph problem (MIBSP) is to find a maximum weight bipartite subgraph $(W,E[W])$ of $G$. Here $E[W]$ is the edge set induced by $W$. An edge subset $F\subseteq
Cornaz, Denis, Mahjoub, Ali Ridha
exaly +2 more sources