Results 11  20
of
45,803
Locallycyclic graphs covering complete tripartite graphs
 Math. Slovaca
, 1992
"... This paper has been digitized, optimized for electronic delivery and stamped ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper has been digitized, optimized for electronic delivery and stamped
CYCLIC GRAPHS WITH DEGENERATE SEQUENCES: A STUDY OF SIMILARITY
"... Similarity of two sets of cyclecontaining molecular graphs: spiroalkanes and full Hamiltonian detour cubic cages, is discussed in terms of inter and intramolecular similarity. Molecular description is given as sequences of some well known topological sequences: ..."
Abstract
 Add to MetaCart
Similarity of two sets of cyclecontaining molecular graphs: spiroalkanes and full Hamiltonian detour cubic cages, is discussed in terms of inter and intramolecular similarity. Molecular description is given as sequences of some well known topological sequences:
Treelike continua as limits of cyclic graphs
 Topology Proc. 4
, 1979
"... A continuum X is a compact, connected metric space with more than one point. A continuum is treelike if it is homeomorphic to the limit of an inverse sequence of trees. A map is a continuous function. A map f: X ~ X has a fixed point if there exists a point x in X such that f(x) x. A continuum X ha ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A continuum X is a compact, connected metric space with more than one point. A continuum is treelike if it is homeomorphic to the limit of an inverse sequence of trees. A map is a continuous function. A map f: X ~ X has a fixed point if there exists a point x in X such that f(x) x. A continuum X has the fixedpointproperty if each map f: X ~ X has a fixed point. R. H. Bing [2] has raised the following question: Question. Does each treelike continuum have the fixed pointproperty? Bing's question has recently been answered by David Bellamy [1]. Theopem 1. Thepe exists a tpeelike continuum X with out the fixedpointppopepty. Here is the gist of Bellamy's proof: Take a certain
List Edge Multicoloring in Bounded Cyclicity Graphs
, 2003
"... The list edge multicoloring problem is a version of edge coloring where every edge e has a list of available colors L(e) and an integer demand x(e). For each e, we have to select x(e) colors from L(e) such that adjacent edges receive disjoint sets of colors. Marcotte and Seymour proved a good cha ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The list edge multicoloring problem is a version of edge coloring where every edge e has a list of available colors L(e) and an integer demand x(e). For each e, we have to select x(e) colors from L(e) such that adjacent edges receive disjoint sets of colors. Marcotte and Seymour proved a good characterization theorem for list edge multicoloring in trees, which can be turned into a polynomial time algorithm.
A nonmonotone FraenkelLévy labelling for the asymmetric combinatorial game on cyclic graphs
, 2004
"... Extending results of Fraenkel, we give an algorithm that determines the value of asymmetric combinatorial games on (possibly cyclic) graphs. ..."
Abstract
 Add to MetaCart
Extending results of Fraenkel, we give an algorithm that determines the value of asymmetric combinatorial games on (possibly cyclic) graphs.
Research Article Arithmetical rank of the edge ideals of some ncyclic graphs with a common edge
"... Abstract: In this paper, we present some lower bounds and upper bounds on the arithmetical rank of the edge ideals of some ncyclic graphs with a common edge. For some special ncyclic graphs with a common edge, we prove that the arithmetical rank equals the projective dimension of the corresponding ..."
Abstract
 Add to MetaCart
Abstract: In this paper, we present some lower bounds and upper bounds on the arithmetical rank of the edge ideals of some ncyclic graphs with a common edge. For some special ncyclic graphs with a common edge, we prove that the arithmetical rank equals the projective dimension
A Query Language and Optimization Techniques for Unstructured Data
, 1996
"... A new kind of data model has recently emerged in which the database is not constrained by a conventional schema. Systems like ACeDB, which has become very popular with biologists, and the recent Tsimmis proposal for data integration organize data in treelike structures whose components can be used ..."
Abstract

Cited by 407 (35 self)
 Add to MetaCart
equally well to represent sets and tuples. Such structures allow great flexibility in data representation What query language is appropriate for such structures? Here we propose a simple language UnQL for querying data organized as a rooted, edgelabeled graph. In this model, relational data may
Strategies to minimise the total run time of cyclic graph based genetic programming with GPUs
 GECCO
"... In this paper, we describe our work to investigate how much cyclic graph based Genetic Programming (GP) can be accelerated on one machine using currently available midrange Graphics Processing Units (GPUs). Cyclic graphs pose different problems for evaluation than do trees and we describe how our C ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
In this paper, we describe our work to investigate how much cyclic graph based Genetic Programming (GP) can be accelerated on one machine using currently available midrange Graphics Processing Units (GPUs). Cyclic graphs pose different problems for evaluation than do trees and we describe how our
Eriksson’s numbers game on certain edgeweighted threenode cyclic graphs
, 2007
"... The numbers game is a oneplayer game played on a finite simple graph with certain “amplitudes” assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at the nodes using the amplitudes in a certain way. This game an ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
and its interactions with Coxeter/Weyl group theory and Lie theory have been studied by many authors. Following Eriksson, we allow the amplitudes on graph edges to be certain real numbers. Games played on such graphs are “Egames. ” We show that for certain such threenode cyclic graphs, any numbers game
Results 11  20
of
45,803