Search Results for ""

A maximal independent vertex set of a graph is an independent vertex set that cannot be expanded to another independent vertex set by addition of any vertex in the graph. A ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. Given a vertex cover of a graph, all ...

Noncommutative topology is a recent program having important and deep applications in several branches of mathematics and mathematical physics. Because every commutative ...

A set A of integers is said to be one-one reducible to a set B (A<<_1B) if there is a one-one recursive function f such that for every x, x in A=>f(x) in B (1) and f(x) in ...

For omega a differential (k-1)-form with compact support on an oriented k-dimensional manifold with boundary M, int_Mdomega=int_(partialM)omega, (1) where domega is the ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...

The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...

Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...

The homotopy groups generalize the fundamental group to maps from higher dimensional spheres, instead of from the circle. The nth homotopy group of a topological space X is ...

The Poincaré hyperbolic disk is a two-dimensional space having hyperbolic geometry defined as the disk {x in R^2:|x|<1}, with hyperbolic metric ...