Abstract. A graph is intrinsically linked if every embedding of the graph contains some pair of cycles that form a non-split link. Robertson, Seymour, and Thomas originally proved the minor-minimal set of intrinsically linked graphs to be the Petersen Family Graphs in 1995. We seek strategies

. The link of a vertex v in a graph G is the subgraph induced by all vertices adjacent to v. If all the links in G are isomorphic to the same graph L, then L is called the link graph of G. We consider the operation of an amalgamation of graphs. Using the construction of the free product of groups

A graph G is k-linked if G has at least 2k vertices, and for every sequence x1, x2,..., xk, y1, y2,..., yk of distinct vertices, G contains k vertex-disjoint paths P1, P2,..., Pk such that Pi joins xi and yi for i = 1, 2,..., k. Moreover, the above defined k-linked graph G is k-linked modulo (m1, m

Abstract not found

We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture ex-ploits correlations in the fine-scale temporal structure of cellular signals in order to group neurons dynamically

engine, special tools are required to store the link matrix of the collection of documents, due to the high number of links typically involved. This work is concerned with the application of com-pression to the link graph. We compare several techniques of compress-ing link graphs, and conclude on speed

Flapan, et al [8] showed that every spatial embedding of K10, the complete graph on ten vertices, contains a non-split three-component link (K10 is intrinsically triple-linked). The papers [2] and [7] extended the list of known intrinsically triple-linked graphs in R³ to include several other

an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages ” that join them together in the link structure. Our formulation has connections to the eigenvectors of certain matrices associated with the link graph

Complex networks describe a wide range of systems in nature and society, much quoted examples including the cell, a network of chemicals linked by chemical reactions, or the Internet, a network of routers and computers connected by physical links. While traditionally these systems were modeled

, such as goals to be achieved, agents to be assigned, alternatives to be negotiated, etc. The paper presents an approach to requirements acquisition which is driven by such higher-level concepts. Requirements models are acquired as instances of a conceptual meta-model. The latter can be represented as a graph