AI & ChatGPT searches , social queriess for CYCLIC GRAPH
Search references for CYCLIC GRAPH. Phrases containing CYCLIC GRAPH
See searches and references containing CYCLIC GRAPH!
Search references for CYCLIC GRAPH. Phrases containing CYCLIC GRAPH
See searches and references containing CYCLIC GRAPH!CYCLIC GRAPH
Index of articles associated with the same name
mathematics, a cyclic graph may mean a graph that contains a cycle, or a graph that is a cycle, with varying definitions of cycles. See: Cycle (graph theory)
Cyclic_graph
Subgraph induced by all nodes linked to a given node of a graph
locally C4 graph, the icosahedron is the unique connected locally C5 graph, and the Paley graph of order 13 is locally C6. Locally cyclic graphs other than
Neighbourhood_(graph_theory)
Graph with oriented edges
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed
Directed_graph
Mathematical group that can be generated as the set of powers of a single element
finite cyclic group, with its single generator, the Cayley graph is a cycle graph, and for an infinite cyclic group with its generator the Cayley graph is
Cyclic_group
Directed graph with no directed cycles
In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it
Directed_acyclic_graph
Undirected graph acted on by a vertex-transitive cyclic group of symmetries
In graph theory, a circulant graph is an undirected graph acted on by a cyclic group of symmetries which takes any vertex to any other vertex. It is sometimes
Circulant_graph
Graph with nodes connected in a closed chain
"cycle graph". These include simple cycle graph and cyclic graph, although the latter term is less often used, because it can also refer to graphs which
Cycle_graph
Index of articles associated with the same name
Circulant graph, a graph with cyclic symmetry Cycle (graph theory), a nontrivial path in some graph from a node to itself Cyclic graph, a graph containing
Cyclic_(mathematics)
Undirected graph named after S. S. Shrikhande
locally cyclic graph, the Shrikhande graph is the 1-skeleton of a Whitney triangulation of some surface; in the case of the Shrikhande graph, this surface
Shrikhande_graph
Franklin graph Frucht graph Goldner–Harary graph Golomb graph Grötzsch graph Harries graph Harries–Wong graph Herschel graph Hoffman graph Hofman Graph H(12
List_of_graphs
Notation of Organic Molecules as Tree Structures and Cyclic Graphs. Part II. Topology of Cyclic Graphs." Interim Report to the National Aeronautics and Space
Tutte_graph
Graph defined from a mathematical group
Cayley graph is the cycle C n {\displaystyle C_{n}} . More generally, the Cayley graphs of finite cyclic groups are exactly the circulant graphs. The Cayley
Cayley_graph
Topics referred to by the same term
cycle, cyclic, or cyclical in Wiktionary, the free dictionary. Cycle, cycles, or cyclic may refer to: Cyclic history, a theory of history Cyclical theory
Cycle
Topics referred to by the same term
Locally cyclic may refer to: Locally cyclic group Locally cyclic graph This disambiguation page lists mathematics articles associated with the same title
Locally_cyclic
Data structure representing a graph
In graph theory and computer science, an adjacency list is a collection of unordered lists used to represent a finite graph. Each unordered list within
Adjacency_list
Class of artificial neural network
graph that can be unrolled and replaced with a strictly feedforward neural network, while an infinite impulse recurrent network is a directed cyclic graph
Recurrent_neural_network
Path in a graph that visits each vertex exactly once
nilpotent groups with cyclic commutator subgroup are Hamiltonian. The flip graph of a convex polygon or equivalently, the rotation graph of binary trees, is
Hamiltonian_path
Tessellation of convex uniform polyhedron cells
4,4,∞] : = . Removing a mirror from some of the cyclic hyperbolic Coxeter graphs become bow-tie graphs: [(3,3,4,1+,4)] = [((3,∞,3)),((3,∞,3))] or , [(3
Paracompact uniform honeycombs
Paracompact_uniform_honeycombs
Embedding a graph in a topological space, often Euclidean
the graph can be 2 {\displaystyle 2} -cell embedded in an orientable surface of genus n {\displaystyle n} . An embedded graph uniquely defines cyclic orders
Graph_embedding
Graph of chess rook moves
In graph theory, a rook's graph is an undirected graph that represents all legal moves of the rook chess piece on a chessboard. Each vertex of a rook's
Rook's_graph
Infinite integer series where the next number is the sum of the two preceding it
coincides for example with the number of independent vertex sets for cyclic graphs C n {\displaystyle C_{n}} of length n ≥ 2 {\displaystyle n\geq 2} .
Lucas_number
Data serialization format
references, in which case the structure is not a tree at all, but a cyclic graph, and cannot be represented in classical S-expression notation unless
S-expression
Directed graph whose edges are labelled invertibly by elements of a group
finite cyclic groups Z n {\displaystyle \mathbb {Z_{n}} } for n > 2. When Π is a cyclic group, the voltage graph may be called a cyclic-voltage graph. Formal
Voltage_graph
the colors that occur in both graphs, the computation is still feasible. Tree kernel, as special case of non-cyclic graphs Molecule mining, as special case
Graph_kernel
Graphs formed by a hypercube's edges and vertices
In graph theory, the hypercube graph Q n {\displaystyle Q_{n}} is the edge graph of the n {\displaystyle n} -dimensional hypercube, that is, it is the
Hypercube_graph
Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes
Glossary_of_graph_theory
Method of analyzing electrochemical reactions
In electrochemistry, cyclic voltammetry (CV) is a type of voltammetric measurement where the potential of the working electrode is ramped linearly versus
Cyclic_voltammetry
Assigning directions to the edges of an undirected graph
undirected graph G is totally cyclic if and only if it is a strong orientation of every connected component of G. Robbins' theorem states that a graph has a
Orientation_(graph_theory)
Network representation of the relationships between objects in a program
objects are referred to as object graphs, after the mathematical objects called graphs studied in graph theory. An object graph is a view of an object system
Object_graph
bipartite subgraph gives a graph each of whose non-trivial components is a c-cyclic graph. For certain sequences of random graphs, Brouwer's conjecture holds
Brouwer's_conjecture
Graph structure studied in group theory
Cycles that contain a non-prime number of elements have cyclic subgroups that are not shown in the graph. For the group Dih4 above, we could draw a line between
Cycle_graph_(algebra)
Combinatorial representation of a graph on an orientable surface
fat graph, or a cyclic graph. More generally, an n {\displaystyle n} -dimensional combinatorial map is a combinatorial representation of a graph on an
Combinatorial_map
Tiling of n-dimensional space
Coxeter group symmetry. It is represented by a Coxeter-Dynkin diagram as a cyclic graph of n + 1 nodes with one node ringed. It is composed of n-simplex facets
Simplicial_honeycomb
Cubic graph with 8 vertices and 12 edges
graph with 4 rungs made cyclic on a topological Möbius strip. The chromatic number of the Wagner graph is 3. The chromatic index of the Wagner graph is 3
Wagner_graph
Copy of a directed graph with redundant edges removed
In the mathematical field of graph theory, a transitive reduction of a directed graph D is another directed graph with the same vertices and as few edges
Transitive_reduction
Planar graph with 4 nodes and 5 edges
mathematical field of graph theory, the diamond graph is a planar, undirected graph with 4 vertices and 5 edges. It consists of a complete graph K 4 {\displaystyle
Diamond_graph
arbitrarily large girth. Using these graphs, one can obtain graphs that avoid any fixed choice of a cyclic graph and clique (of more than two vertices)
Gyárfás–Sumner_conjecture
On Hamiltonian cycles in planar graphs
non-Hamiltonian cubic polyhedral graphs with high cyclic edge connectivity. The cyclic edge connectivity of a graph is the smallest number of edges whose
Grinberg's_theorem
Probabilistic model
2014-04-27. Richardson, Thomas (1996). "A discovery algorithm for directed cyclic graphs". Proceedings of the Twelfth Conference on Uncertainty in Artificial
Graphical_model
Methodic assignment of colors to elements of a graph
In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain
Graph_coloring
In polytope theory, the edge graph (also known as vertex-edge graph or just graph) of a polytope is a combinatorial graph whose vertices and edges correspond
Graph_of_a_polytope
Alternative mathematical ordering
free transitive action by a finite cyclic group. Another formulation is to make X into the standard directed cycle graph on n vertices, by some matching
Cyclic_order
Type of chart
graph") is: you don't mind reading stacked areas instead of position along a common scale (see Cleveland's Hierarchy), the data set is truly cyclic,
Radar_chart
orientations may be generalized to totally cyclic orientations of disconnected graphs. The set of strong orientations of a graph forms a partial cube, with adjacent
Strong_orientation
Undirected graph defined from a group
prime graphs that replace the existence of a cyclic subgroup of order p q {\displaystyle pq} , in the definition for adjacency in a prime graph, by the
Prime_graph
symbol t0,1{3[n+1]}, and is represented by a Coxeter-Dynkin diagram as a cyclic graph of n+1 nodes with two adjacent nodes ringed. It is composed of n-simplex
Cyclotruncated simplicial honeycomb
Cyclotruncated_simplicial_honeycomb
Graph often embedded in the Klein bottle
3-edge-connected perfect graph. The automorphism group of the Franklin graph is of order 48 and is isomorphic to Z/2Z×S4, the direct product of the cyclic group Z/2Z
Franklin_graph
On graphs with given symmetry groups
the undirected graph created by performing these replacements will also have G as its symmetry group. With three exceptions – the cyclic groups of orders
Frucht's_theorem
Graph representing faces of another graph
mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has an edge for each
Dual_graph
Algorithm component in computer science
(named "check" there); applying rule "eliminate" instead leads to a cyclic graph (i.e. an infinite term) in the last step. ISO Prolog implementations
Occurs_check
Symbolic cognitive architecture
memory of fact-like structures. Data in SMEM is represented as directed cyclic graphs. Structures can be stored or retrieved by rules that create commands
Soar_(cognitive_architecture)
Probabilistic graphical representation of causal relationships
combinations. Similar ideas may be applied to undirected, and possibly cyclic, graphs such as Markov networks. Suppose we want to model the dependencies between
Bayesian_network
Generalization of graph theory
acyclic if and only if its incidence graph (the bipartite graph defined above) is acyclic. Thus Berge-cyclicity can obviously be tested in linear time
Hypergraph
60, the simple groups are precisely the cyclic groups Zn, for prime n.) The identity element in the cycle graphs is represented by the black circle. The
List_of_small_groups
Pictorial representation of symmetry
of Lie theory, a Dynkin diagram, named for Eugene Dynkin, is a type of graph with some edges doubled or tripled (drawn as a double or triple line). Dynkin
Dynkin_diagram
Topics referred to by the same term
cycle decomposition can mean: Cycle decomposition (graph theory), a partitioning of the vertices of a graph into subsets, such that the vertices in each subset
Cycle_decomposition
Shape with nine sides
the album art featuring a nonagonal complete graph. The album consists of nine songs and repeats cyclically. Enneagram (nonagram) Trisection of the angle
Nonagon
Element of graph theory
totally cyclic orientations of planar graphs extends in this form to nonplanar graphs as well: the Tutte polynomial of the dual graph of a planar graph is
Acyclic_orientation
Python library for graphs and networks
for visualizing cyclic or symmetric graphs, where the arrangement of nodes along the circle reflects the underlying topology of the graph. The Shell layout
NetworkX
Graphical representation of a computer program or algorithm
In computer science, a control-flow graph (CFG) is a representation, using graph notation, of all paths that might be traversed through a function during
Control-flow_graph
Mathematics concept
cyclically reduced word is a cyclic permutation of the letters in the word. For instance b − 1 a b c b {\displaystyle b^{-1}abcb} is not cyclically reduced
Free_group
Infinite graph containing all countable graphs
In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with
Rado_graph
Class of graphs
forcing conjecture states that the forcing graphs are exactly the cyclic bipartite graphs. It has been described as "one of the major open problems in extremal
Forcing_graph
1960s artificial intelligence project
enumeration and notation of organic molecules as tree structures and cyclic graphs. part i- notational algorithm for tree structures. Interim Report to
Dendral
Irish annual school students' science competition
2014 Paul Clarke 17 St Paul's College, Raheny, Dublin Contributions to cyclic graph theory. This is the second time the school has won the event. 2015 Ian
Young Scientist and Technology Exhibition
Young_Scientist_and_Technology_Exhibition
Mathematical abelian group
is the smallest group that is not cyclic. Up to isomorphism, there is only one other group of order four: the cyclic group of order 4. Both groups are
Klein_four-group
Representation of an expression as a generalized graph
they can take the structure of a directed acyclic graph) but also cyclic/recursive subexpressions (cyclic digraphs). Abstract syntax trees cannot represent
Term_graph
Topics referred to by the same term
to: Unicyclic graph, a graph in mathematics with one cycle One-loop Feynman diagram, a type of pictorial representation in physics A cyclic compound in
Unicyclic
7-regular undirected graph with 50 nodes and 175 edges
of graph theory, the Hoffman–Singleton graph is a 7-regular undirected graph with 50 vertices and 175 edges. It is the unique strongly regular graph with
Hoffman–Singleton_graph
Software package for graph visualization
of multiple cyclic structures, such as certain telecommunications networks. dotty a graphical user interface to visualize and edit graphs. lefty a programmable
Graphviz
Natural number
dual positions with the vertices of another tetrahedron. The smallest non-cyclic group has four elements; it is the Klein four-group. An alternating groups
4
Constructs with triply-connected vertices
be cyclically permuted. If a graph contains different Hamiltonian circuits, one may select one of these to accommodate the notation. The same graph may
Table_of_simple_cubic_graphs
order of the (cyclic) group of "field automorphisms" (generated by a Frobenius automorphism), and g is the order of the group of "graph automorphisms"
List_of_finite_simple_groups
Classification system for symmetry groups in geometry
generator for [2p+,2+,2q+], as {0123,0132}. Half groups, [2p+,2+,2q+]+, or cyclic graph, [(2p+,2+,2q+,2+)], expressed by Conway is [Cp×Cq], order pq, with one
Coxeter_notation
Node ordering for directed acyclic graphs
of the Hamiltonian path problem for more general directed graphs (i.e., cyclic directed graphs). Topological orderings are also closely related to the concept
Topological_sorting
Mathematical group based upon a finite number of elements
structure-preserving transformations. Important examples of finite groups include cyclic groups and permutation groups. The study of finite groups has been an integral
Finite_group
Graph of numbers differing by a square
Paley graphs form an infinite family of conference graphs, which yield an infinite family of symmetric conference matrices. Paley graphs allow graph-theoretic
Paley_graph
Largest independent set of paired elements
in the hypergraph of triangles, the same cyclic sequence of vertices would form a cycle in the underlying graph. Thus, finding a largest set of hyperedges
Matroid_parity_problem
Process to determine the causes of accidents to prevent recurrence
events", results from Causal Analysis usually have the form of directed a-cyclic graphs – the nodes being events and the edges the cause-effect relations. Methods
Accident_analysis
Finite group
four isomorphism classes of non-abelian groups of order 2n which have a cyclic subgroup of index 2. Two are well known, the generalized quaternion group
Quasidihedral_group
Branch of logic
whether the class of cyclic graphs can be distinguished among graphs by a FO sentence, which can also be phrased as asking whether cyclicity is FO-expressible
Finite_model_theory
Algorithmic problem of finding non-crossing drawings
In graph theory, the planarity testing problem is the algorithmic problem of testing whether a given graph is a planar graph (that is, whether it can
Planarity_testing
Type of graph vertex labeling
graceful labeling? More unsolved problems in mathematics In graph theory, a graceful labeling of a graph with m edges is a labeling of its vertices with some
Graceful_labeling
of the symmetric group S4 and the cyclic group Z/2Z. Despite not being vertex- or edge-transitive, the Hoffmann graph is still 1-walk-regular (but not
Hoffman_graph
Tree graph with all nodes within distance 1 from central path
They are the trees whose square is a Hamiltonian graph. That is, in a caterpillar, there exists a cyclic sequence of all the vertices in which each adjacent
Caterpillar_tree
Shape with six sides
\mathrm {t} \{3\}} . A regular hexagon is bicentric, meaning that it is both cyclic (has a circumscribed circle) and tangential (has an inscribed circle). The
Hexagon
Set of random variables
of random variables having a Markov property described by an undirected graph. In other words, a random field is said to be a Markov random field if it
Markov_random_field
Type of group in abstract algebra
homogeneous spaces, and automorphism groups of graphs, such as the Higman–Sims group and the Higman–Sims graph. The elements of the symmetric group on a set
Symmetric_group
3-regular graph with no 3-edge-coloring
In the mathematical field of graph theory, a snark is an undirected graph with exactly three edges per vertex whose edges cannot be colored with only three
Snark_(graph_theory)
Study of discrete mathematical structures
continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics
Discrete_mathematics
Software resource tracking technique
collection schemes, it is often helpful to think of the reference graph, which is a directed graph where the vertices are objects and there is an edge from an
Reference_counting
Circular statistical graph of proportionality
credited to William Playfair's Statistical Breviary of 1801, in which two such graphs are used. Playfair presented an illustration, which contained a series of
Pie_chart
tree problem. Feedback vertex set Feedback arc set Graph coloring Graph homomorphism problem Graph partition into subgraphs of specific types (triangles
List_of_NP-complete_problems
Linear algebra matrix
interpreted analytically as the integral kernel of a convolution operator on the cyclic group C n {\displaystyle C_{n}} and hence frequently appear in formal descriptions
Circulant_matrix
mathematical graph theory, the Higman–Sims graph is a 22-regular undirected graph with 100 vertices and 1100 edges. It is the unique strongly regular graph srg(100
Higman–Sims_graph
Theorem in group theory
in the general case (1971). Let Γ {\displaystyle \Gamma } be a connected graph where the degree of every vertex is finite. One can view Γ {\displaystyle
Stallings theorem about ends of groups
Stallings_theorem_about_ends_of_groups
Acceleration of real-world corrosion failures
Cyclic Corrosion Testing (CCT) has evolved in recent years, largely within the automotive industry, as a way of accelerating real-world corrosion failures
Cyclic_corrosion_testing
Measure of the structural complexity of a software program
Cyclomatic complexity is computed using the control-flow graph of the program. The nodes of the graph correspond to indivisible groups of commands of a program
Cyclomatic_complexity
geometry including cyclic polytopes, the no-three-in-line problem, and a geometric proof of the chromatic number of Kneser graphs. Every hyperplane intersects
Moment_curve
Problem in graph theory
Cayley graph of an abelian group has a Hamiltonian path; however, every cyclic group whose order is not a prime power has a directed Cayley graph that does
Lovász_conjecture
CYCLIC GRAPH
CYCLIC GRAPH
Boy/Male
Hindu
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Boy/Male
Tamil
Janardhan | ஜநாரà¯à®¤à®¨
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Janardhan | ஜநாரà¯à®¤à®¨
Boy/Male
Hindu
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Boy/Male
English
royal.
Surname or Lastname
English
English : nickname from Middle English loller ‘indolent fellow’, a derivative of lolle ‘to droop, dangle, or loll’.English : nickname from Middle English lollere ‘mumbler’, bestowed on a pious person or on a Lollard (a follower of the 14th-century religious reformer John Wyclif).
Boy/Male
Tamil
Janardhana | ஜநாரà¯à®¤à®¾à®¨à®¾
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Janardhana | ஜநாரà¯à®¤à®¾à®¨à®¾
Boy/Male
Hindu, Indian, Marathi
Vishnu; The Healer; Who Cures the Disease of Birth and Death Cycles
Boy/Male
Hindu
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Boy/Male
Hindu
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Boy/Male
Assamese, Hindu, Indian, Marathi
The Healer; Vishnu; Who Cures the Disease of Birth and Death Cycles
Boy/Male
Tamil
Jaramarana Varjita | ஜராமாஂரநா வரà¯à®œà¯€à®¤à®¾
Free from the cycle of births and deaths
Jaramarana Varjita | ஜராமாஂரநா வரà¯à®œà¯€à®¤à®¾
Surname or Lastname
English
English : habitational name from a place in Cheshire named Kelsall, from the Middle English personal name Kell + Old English halh ‘nook or corner of land’, or possibly from Kelshall in Hertfordshire, which is named with an Old English personal name Cylli + Old English hyll ‘hill’, or even Kelsale in Suffolk, named with an Old English personal name Cēl(i) or Cēol + Old English halh.
Girl/Female
Hindu, Indian, Traditional
The Periphery or Rim of a Wheel or Cycle
Boy/Male
Tamil
Janardana | ஜநாரà¯à®¤à®¨
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Janardana | ஜநாரà¯à®¤à®¨
Male
Irish
Irish name CAILTE means "the thin man." This is the name of a character from the Fenian cycle.
Male
Spanish
Spanish name of Germanic origin, possibly GUIOMAR means "famous in battle." In the 13th century Vulgate Cycle of Arthurian romance, Sir Guiomar is the proud and beautiful knight of the crystal stream.
Boy/Male
Tamil
Janardan | ஜநாரà¯à®¤à®¨
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Janardan | ஜநாரà¯à®¤à®¨
Boy/Male
Anglo, British, English
With Royal Might
Girl/Female
American, Arabic, Australian, British, Chinese, English
Stone of the Colic; The Gemstone Jade; Green in Colour
Boy/Male
Hindu
Free from the cycle of births and deaths
CYCLIC GRAPH
CYCLIC GRAPH
Girl/Female
Hindu, Indian
Fragrance
Boy/Male
Hindu
Undefeatable
Boy/Male
Tamil
Pramodan | பà¯à®°à®®à¯‹à®¤à®¨
Lord Vishnu
Boy/Male
Australian, British, English
Dream; Ash-tree Meadow
Girl/Female
Indian
Joy, Joyous
Biblical
valley of sight
Surname or Lastname
English (Yorkshire)
English (Yorkshire) : habitational name from Yeadon, a place in West Yorkshire, named from Old English gǣh ‘steep’ + dūn ‘hill’.
Boy/Male
Tamil
Venkatshiva | வேநà¯à®•à®¾à®¤à¯à®·à¯€à®µà®¾Â
Boy/Male
Arabic, Muslim
Perfumer; Perfume Seller
Boy/Male
American, Australian, Christian, Gaelic, Irish
Wise Aid; High Longing; Hound Lover; Form of Connor; Wolf Lover
CYCLIC GRAPH
CYCLIC GRAPH
CYCLIC GRAPH
CYCLIC GRAPH
CYCLIC GRAPH
n.
One entire round in a circle or a spire; as, a cycle or set of leaves.
n.
A cycler.
n.
One who rides a bicycle or tricycle; a cycler, or cyclist.
a.
Alt. of Cyclical
a.
Of or pertaining to a cycle or circle; moving in cycles; as, cyclical time.
a.
Of or pertaining to matter; material; corporeal; as, hylic influences.
a.
Having the form of, or living in, a cyst; as, the cystic entozoa.
a.
Containing cysts; cystose; as, cystic sarcoma.
n.
A mean or inferior poet, perhaps from his habit of wandering around as a stroller; an itinerant poet. Also, a name given to the cyclic poets. See under Cyclic, a.
a.
Of or pertaining to colic; affecting the bowels.
a.
Of or pertaining to the colon; as, the colic arteries.
a.
Pertaining to the Dog Star; as, the cynic, or Sothic, year; cynic cycle.
a.
See Cystic.
n.
The act or practice of using a cycle; cycling.
n.
The act, art, or practice, of riding a cycle, esp. a bicycle or tricycle.
v. i.
To pass through a cycle of changes; to recur in cycles.
v. i.
To ride a bicycle, tricycle, or other form of cycle.
p. pr. & vb. n.
of Cycle
a.
Adhering to a fixed circle of legends; cyclic; hence, mean; inferior. See Cyclic poets, under Cyclic.
imp. & p. p.
of Cycle