Results 1  10
of
183
Noncyclic graph of a group
, 2007
"... We associate a graph ΓG to a non locally cyclic group G (called the noncyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G) = {x ∈ G  〈x, y 〉 is cyclic for all y ∈ G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph and ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We associate a graph ΓG to a non locally cyclic group G (called the noncyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G) = {x ∈ G  〈x, y 〉 is cyclic for all y ∈ G}, and join two vertices if they do not generate a cyclic subgroup. We study the properties of this graph
Noncyclic graph associated with a group
, 2008
"... We associate a graph CG to a non locally cyclic group G (called the noncyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G) = {x ∈ G  〈x, y 〉 is cyclic for all y ∈ G} is called the cyclicizer of G, and join two vertices if they do not generate a cyclic subgroup. For a simple ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We associate a graph CG to a non locally cyclic group G (called the noncyclic graph of G) as follows: take G\Cyc(G) as vertex set, where Cyc(G) = {x ∈ G  〈x, y 〉 is cyclic for all y ∈ G} is called the cyclicizer of G, and join two vertices if they do not generate a cyclic subgroup. For a simple
Noncyclic train timetabling and comparability graphs
 Operations Research Letters 38(3): 179
, 2010
"... Abstract We consider the customary formulation of noncyclic train timetabling, calling for a maximumprofit collection of compatible paths in a suitable acyclic network. The associated ILP models look for a maximumweight clique in a(n exponentiallylarge) compatibility graph. By taking a close loo ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Abstract We consider the customary formulation of noncyclic train timetabling, calling for a maximumprofit collection of compatible paths in a suitable acyclic network. The associated ILP models look for a maximumweight clique in a(n exponentiallylarge) compatibility graph. By taking a close
FieldSensitive Unreachability and NonCyclicity Analysis
"... Fieldsensitive static analyses of objectoriented code use approximations of the computational states where fields are taken into account, for better precision. This article presents a novel and sound definite analysis of Java bytecode that states two strictly related properties: fieldsensitive un ..."
Abstract
 Add to MetaCart
sensitive unreachability between program variables and fieldsensitive noncyclicity of program variables. The latter exploits the former for better precision. We build a dataflow analysis based on constraint graphs, whose nodes are program points and whose arcs propagate information according to the semantics of each
Group With Maximum Undirected Edges in Directed Power Graph Among All Finite NonCyclic
, 2014
"... ar ..."
Cyclic sieving phenomenon in noncrossing connected graphs
 Electronic Journal of Combinatorics
"... Abstract. A noncrossing connected graph is a connected graph on vertices arranged in a circle such that its edges do not cross. The count for such graphs can be made naturally into a qbinomial generating function. We prove that this generating function exhibits the cyclic sieving phenomenon, as co ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Abstract. A noncrossing connected graph is a connected graph on vertices arranged in a circle such that its edges do not cross. The count for such graphs can be made naturally into a qbinomial generating function. We prove that this generating function exhibits the cyclic sieving phenomenon
Cyclic sieving for two families of noncrossing graphs
"... Abstract. We prove the cyclic sieving phenomenon for noncrossing forests and noncrossing graphs. More precisely, the cyclic group acts on these graphs naturally by rotation and we show that the orbit structure of this action is encoded by certain polynomials. Our results confirm two conjectures of ..."
Abstract
 Add to MetaCart
Abstract. We prove the cyclic sieving phenomenon for noncrossing forests and noncrossing graphs. More precisely, the cyclic group acts on these graphs naturally by rotation and we show that the orbit structure of this action is encoded by certain polynomials. Our results confirm two conjectures
SUTTA: ScoringandUnfolding Trimmed Tree Assembler
"... We have developed a novel algorithmic framework for assembling haplotypic genome sequences, and thus address a key open problem in the study of populations and polymorphisms, which cannot be solved with the currently available genotypic sequences. In the most general setting, this problem is commonl ..."
Abstract
 Add to MetaCart
approach so far in the literature has been to recast the problem in graphtheoretic terms as one of finding a noncyclic graph with certain properties and with the objective of being the shortest. However, even these approaches are not without technical challenges before it can be widely used to sequence a
Class. Quantum Grav. 16 (1999) 1817–1832. Printed in the UK PII: S02649381(99)998003 Causal set dynamics: a toy model
, 1998
"... Abstract. We construct a quantum measure on the power set of noncyclic oriented graphs of ..."
Abstract
 Add to MetaCart
Abstract. We construct a quantum measure on the power set of noncyclic oriented graphs of
Results 1  10
of
183