Skip to search formSkip to main contentSkip to account menu

Induced subgraph

In graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges connecting… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
The paper studies a class of formation control problem, i.e. the controllability for multi-agent systems under leader-follower… 
2004
2004
The problem of searching for polynomial solutions of linear functional (differential, difference, and q-difference) equations is… 
1992
1992
The dependence of coincidence of the global, local and pairwise Markov properties on the underlying undirected graph is examined… 
1989
1989
A signed graph is a graph whose edges are labelled positive or negative. A signed graph is said to be balanced if the set of… 
Highly Cited
1966
Highly Cited
1966
A method of finding every cycle of an undirected linear graph by computation, rather than search, is presented. The method…