Add to ORKGNational Science Foundation / ECS 84-10902 and 8404866Semiconductor Research Corporation / 86-12-109Joint Services Electronics Program / JSEP N00014-84-C-0149Ope
AbstractWe relate two concepts in graph theory and algorithmic complexity, namely the search number ...
The separation dimension of a graph G is the minimum positive integer d for which there is an embedd...
Let G =(V,E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For an...
Coordinated Science Laboratory was formerly known as Control Systems LaboratorySemiconductor Researc...
AbstractA connected graph G can be disconnected or reduced to a single vertex by removing an appropr...
In this paper, we consider the vertex separator problem. Given an undirected graph G, the vertex sep...
For a graph G = (V, E) and a set S ⊆ V of at least two vertices, an S-tree is a such subgraph T of G...
2012 4th International Conference on Problems of Cybernetics and Informatics, PCI 2012 -- 12 Septemb...
Determining vertex subsets are known tools to provide information about automorphism groups of graph...
AbstractThe degree set of a finite simple graph G is the set of distinct degrees of vertices of G. A...
For positive integers d, c and v, the minimum number of nodes for a c-connected v-regular graph of d...
The separation dimension of a graph G is the smallest natural number k for which the vertices of G c...
We give a bound on the sizes of two sets of vertices at a given minimum distance (a separated pair o...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
Due to many technical advances of the last decades, networks are used everywhere. Graphs can be used...
AbstractWe relate two concepts in graph theory and algorithmic complexity, namely the search number ...
The separation dimension of a graph G is the minimum positive integer d for which there is an embedd...
Let G =(V,E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For an...
Coordinated Science Laboratory was formerly known as Control Systems LaboratorySemiconductor Researc...
AbstractA connected graph G can be disconnected or reduced to a single vertex by removing an appropr...
In this paper, we consider the vertex separator problem. Given an undirected graph G, the vertex sep...
For a graph G = (V, E) and a set S ⊆ V of at least two vertices, an S-tree is a such subgraph T of G...
2012 4th International Conference on Problems of Cybernetics and Informatics, PCI 2012 -- 12 Septemb...
Determining vertex subsets are known tools to provide information about automorphism groups of graph...
AbstractThe degree set of a finite simple graph G is the set of distinct degrees of vertices of G. A...
For positive integers d, c and v, the minimum number of nodes for a c-connected v-regular graph of d...
The separation dimension of a graph G is the smallest natural number k for which the vertices of G c...
We give a bound on the sizes of two sets of vertices at a given minimum distance (a separated pair o...
. Let an edge cut partition the vertex set of the n-cube into k subsets A1 ; :::; Ak with jjA i j \...
Due to many technical advances of the last decades, networks are used everywhere. Graphs can be used...
AbstractWe relate two concepts in graph theory and algorithmic complexity, namely the search number ...
The separation dimension of a graph G is the minimum positive integer d for which there is an embedd...
Let G =(V,E) be an undirected graph. Let C be a subset of vertices that we shall call a code. For an...