AI & ChatGPT searches , social queriess for CYCLE GRAPH
Search references for CYCLE GRAPH. Phrases containing CYCLE GRAPH
See searches and references containing CYCLE GRAPH!
Search references for CYCLE GRAPH. Phrases containing CYCLE GRAPH
See searches and references containing CYCLE GRAPH!CYCLE GRAPH
Graph with nodes connected in a closed chain
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices (at least 3, if
Cycle_graph
Trail in which only the first and last vertices are equal
In graph theory, a cycle in a graph is a non-empty trail in which only the first and last vertices are equal. A directed cycle in a directed graph is
Cycle_(graph_theory)
Trail in a graph that visits each edge once
graph has an Euler cycle if and only if every vertex has an even number of incident edges. The term Eulerian graph has two common meanings in graph theory
Eulerian_path
Graph divided into two independent sets
usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles. The two sets U {\displaystyle
Bipartite_graph
Path in a graph that visits each vertex exactly once
known as Hamilton's puzzle, which involves finding a Hamiltonian cycle in the edge graph of the dodecahedron. Hamilton solved this problem using the icosian
Hamiltonian_path
Graph structure studied in group theory
a cycle graph of a group is an undirected graph that illustrates the various cycles of that group, given a set of generators for the group. Cycle graphs
Cycle_graph_(algebra)
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
Vertices connected in pairs by edges
In discrete mathematics, particularly in graph theory, a graph is a structure consisting of a set of objects where some pairs of the objects are in some
Graph_(discrete_mathematics)
Cubic graph with 10 vertices and 15 edges
bridgeless graph has a cycle-continuous mapping to the Petersen graph. More unsolved problems in mathematics In the mathematical field of graph theory, the
Petersen_graph
Graph where all long cycles have a chord
of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not part of the cycle but
Chordal_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
Cycle graph plus universal vertex
In graph theory, a wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle. A wheel graph with n vertices can
Wheel_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
Directed graph with no directed cycles
mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it consists
Directed_acyclic_graph
Geometric graph with unit edge lengths
Generalizing the triangle graph, every cycle graph is a unit distance graph, realized by a regular polygon. Two finite unit distance graphs, connected at a single
Unit_distance_graph
Topics referred to by the same term
a graph from a node to itself Cycle graph, a graph that is itself a cycle Cycle matroid, a matroid derived from the cycle structure of a graph Cycle (sequence)
Cycle
Graph that can be embedded in the plane
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect
Planar_graph
Graph with oriented edges
directed graph is an oriented graph if and only if it has no 2-cycle. Such a graph can be obtained by applying an orientation to an undirected graph. Tournaments
Directed_graph
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
Non-crossing graph with vertices on outer face
of a cycle graph). As they showed, when the base graph is biconnected, a graph constructed in this way is planar if and only if its base graph is outerplanar
Outerplanar_graph
Structure-preserving correspondence between node-link graphs
In the mathematical field of graph theory, a graph homomorphism is a mapping between two graphs that respects their structure. More concretely, it is a
Graph_homomorphism
Graph without triples of adjacent vertices
equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4, graphs with no induced 3-cycle, or locally independent graphs. By Turán's theorem
Triangle-free_graph
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
Graph defined from a mathematical group
In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group, is a graph that encodes the abstract
Cayley_graph
Mathematical group that can be generated as the set of powers of a single element
graph is a cycle graph, and for an infinite cyclic group with its generator the Cayley graph is a doubly infinite path graph. However, Cayley graphs can
Cyclic_group
Length of a shortest cycle contained in the graph
In graph theory, the girth of an undirected graph is the length of a shortest cycle contained in the graph. If the graph does not contain any cycles (that
Girth_(graph_theory)
Graph of triangles with a shared vertex
friendship graph Fn can be constructed by joining n copies of the cycle graph C3 with a common vertex, which becomes a universal vertex for the graph. By construction
Friendship_graph
Problem of finding a cycle through all vertices of a graph
The Hamiltonian cycle problem is similar to the Hamiltonian path problem, except it asks if a given graph contains a Hamiltonian cycle. This problem may
Hamiltonian_path_problem
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)
Graph with at most one cycle per component
In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and
Pseudoforest
Graph path which is an induced subgraph
hypercube graphs is known as the snake-in-the-box problem. Similarly, an induced cycle is a cycle that is an induced subgraph of G; induced cycles are also
Induced_path
Unproven conjecture in graph theory
mathematics Must every cubic graph contain a simple cycle of length a power of two? More unsolved problems in mathematics In graph theory, the unproven Erdős–Gyárfás
Erdős–Gyárfás_conjecture
Graph where each vertex has the same number of neighbors
disconnected vertices, a 1-regular graph consists of disconnected edges, and a 2-regular graph consists of a disjoint union of cycles and infinite chains. In analogy
Regular_graph
Graph representing edges of another graph
In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges
Line_graph
Bivariegated graph Cage (graph theory) Cayley graph Circle graph Clique graph Cograph Common graph Complement of a graph Complete graph Cubic graph Cycle graph De
List_of_graph_theory_topics
Graph with tight clique-coloring relation
In graph theory, a perfect graph is a graph in which the chromatic number equals the size of the maximum clique, both in the graph itself and in every
Perfect_graph
In graph theory, a cycle decomposition is a decomposition (a partitioning of a graph's edges) into cycles. Every vertex in a graph that has a cycle decomposition
Cycle decomposition (graph theory)
Cycle_decomposition_(graph_theory)
Undirected cubic graph derived from a hypercube graph
In graph theory, the cube-connected cycles is an undirected cubic graph, formed by replacing each vertex of a hypercube graph by a cycle. It was introduced
Cube-connected_cycles
Order-zero graph or any edgeless graph
complete graph Kn. Glossary of graph theory Cycle graph Path graph Harary, Frank; Read, Ronald C. (1974). "Is the null-graph a pointless concept?". Graphs and
Null_graph
Bipartite non-Hamiltonian polyhedral graph
polyhedral graph (the graph of a convex polyhedron), and is the smallest polyhedral graph that does not have a Hamiltonian cycle, a cycle passing through all
Herschel_graph
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
Area of discrete mathematics
computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context
Graph_theory
Planar graph with 5 nodes and 6 edges
non-graceful simple graphs with five vertices. One of them is the butterfly graph. The two others are cycle graph C5 and the complete graph K5. A graph is bowtie-free
Butterfly_graph
Edge whose deletion would disconnect a graph
and only if it is not contained in any cycle. For a connected graph, a bridge can uniquely determine a cut. A graph is said to be bridgeless or isthmus-free
Bridge_(graph_theory)
Edge that connects a node to itself
For a directed graph, a loop adds one to the in degree and one to the out degree. Cycle (graph theory) Graph theory Glossary of graph theory Möbius ladder
Loop_(graph_theory)
Undirected graph acted on by a vertex-transitive cyclic group of symmetries
symmetry of the drawing. The graph is a Cayley graph of a cyclic group. Every cycle graph is a circulant graph, as is every crown graph with number of vertices
Circulant_graph
Concept in graph theory
In graph theory, a strongly regular graph (SRG) is a regular graph G = (V, E) with v vertices and degree k such that for some given integers λ , μ ≥ 0
Strongly_regular_graph
Cycles in a graph that cover each edge twice
bridgeless graph have a multiset of cycles covering every edge exactly twice? More unsolved problems in mathematics In graph-theoretic mathematics, a cycle double
Cycle_double_cover
Graph containing cycles of all possible lengths
In the mathematical study of graph theory, a pancyclic graph is a directed graph or undirected graph that contains cycles of all possible lengths from
Pancyclic_graph
Connectivity measure in graph theory
In graph theory, the cycle rank of a directed graph is a digraph connectivity measure proposed first by Eggan and Büchi (Eggan 1963). Intuitively, this
Cycle_rank
Basic concept of graph theory
mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that
Connectivity_(graph_theory)
Partition of a graph whose components are reachable from all vertices
In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly
Strongly_connected_component
Tree which includes all vertices of a graph
of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of G. In general, a graph may
Spanning_tree
Graph with nodes connected linearly
symmetric group. Path (graph theory) Ladder graph Caterpillar tree Complete graph Null graph Path decomposition Cycle (graph theory) While it is most
Path_graph
Graph whose vertices correspond to combinations of a set of n elements
In graph theory, the Kneser graph K(n, k) (alternatively KGn,k) is the graph whose vertices correspond to the k-element subsets of a set of n elements
Kneser_graph
Mathematical tree with cycle through leaves
In graph theory, a Halin graph is a type of planar graph, constructed by connecting the leaves of a tree into a cycle. The tree must have at least four
Halin_graph
precedence graph, also named conflict graph and serializability graph, is used in the context of concurrency control in databases. It is the directed graph representing
Precedence_graph
Graph property
distance-regular graph form an association scheme. Some first examples of distance-regular graphs include: The complete graphs. The cycle graphs. The odd graphs. The
Distance-regular_graph
Mathematical tree of cycles
In graph theory, a cactus (sometimes called a cactus tree) is a connected graph in which any two simple cycles have at most one vertex in common. Equivalently
Cactus_graph
Index of articles associated with the same name
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), a cycle in
Cyclic_graph
Subgraph induced by all nodes linked to a given node of a graph
In graph theory, the neighbourhood of a vertex v in a graph G is the subgraph of G induced by all the vertices that are connected to v by an edge (vertices
Neighbourhood_(graph_theory)
Subgraph with contracted edges
In graph theory, an undirected graph H is called a minor of the undirected graph G if H can be formed from G by deleting edges and vertices and by contracting
Graph_minor
Perfect graphs have neither odd holes nor odd antiholes
In graph theory, the strong perfect graph theorem is a forbidden graph characterization of the perfect graphs as being exactly the graphs that have neither
Strong_perfect_graph_theorem
Graph with same nodes as but complementary connections to another
self-complementary graph is a graph that is isomorphic to its own complement. Examples include the four-vertex path graph and five-vertex cycle graph. There is
Complement_graph
3-regular graph with no 3-edge-coloring
In the study of various important and difficult problems in graph theory (such as the cycle double cover conjecture and the 5-flow conjecture), one encounters
Snark_(graph_theory)
Cycles in a graph that generate all cycles
In graph theory, a branch of mathematics, a cycle basis of an undirected graph is a set of simple cycles that forms a basis of the cycle space of the
Cycle_basis
Graph which is isomorphic to its complement
4-vertex path graph and the 5-vertex cycle graph. Every Paley graph is self-complementary. For example, the 3 × 3 rook's graph (the Paley graph of order nine)
Self-complementary_graph
Directed graph representing dependencies
mathematics, computer science and digital electronics, a dependency graph is a directed graph representing dependencies of several objects towards each other
Dependency_graph
Intersection graph for intervals on the real number line
intersection graph of the intervals. Interval graphs are chordal graphs and perfect graphs. They can be recognized in linear time, and an optimal graph coloring
Interval_graph
Undirected, connected, and acyclic graph
1-degenerate.) G has no simple cycles and has n − 1 edges. As elsewhere in graph theory, the order-zero graph (graph with no vertices) is generally not
Tree_(graph_theory)
Generalization of graph theory
hypergraph is a generalization of a graph in which an edge can join any number of vertices. In contrast, in an ordinary graph, an edge connects exactly two
Hypergraph
is also known as the cycle graph C 3 {\displaystyle C_{3}} and the complete graph K 3 {\displaystyle K_{3}} . The triangle graph has chromatic number
Triangle_graph
All even-degree subgraphs of a graph
In graph theory, a branch of mathematics, the (binary) cycle space of an undirected graph is the set of its even-degree spanning subgraphs, or the set
Cycle_space
Regular graph with girth more than twice its diameter
(the shortest cycle length) is more than twice its diameter (the distance between the farthest two vertices). If the degree of such a graph is d and its
Moore_graph
Undirected graph with 14 vertices
all cycles in the graph have six or more edges. Every smaller cubic graph has shorter cycles, so this graph is the 6-cage, the smallest cubic graph of
Heawood_graph
Measure of capacity of a communications channel defined from a graph
In graph theory, the Shannon capacity of a graph is a graph invariant defined from the number of independent sets of strong graph products. It is named
Shannon_capacity_of_a_graph
On graph coloring and neighborhood size
graph in which every vertex has at most Δ neighbors, the vertices can be colored with only Δ colors, except for two cases, complete graphs and cycle graphs
Brooks'_theorem
graph theory, an odd cycle transversal of an undirected graph is a set of vertices of the graph that has a nonempty intersection with every odd cycle
Odd_cycle_transversal
discipline of graph theory, the (m,n)-tadpole graph is a special type of graph consisting of a cycle graph on m (at least 3) vertices and a path graph on n vertices
Tadpole_graph
Graph whose embedding in a Euclidean space forms a regular tiling
In graph theory, a lattice graph, mesh graph, or grid graph is a graph whose drawing, embedded in some Euclidean space R n {\displaystyle \mathbb {R}
Lattice_graph
Graph with a prism as its skeleton
of generalized Petersen graphs, with parameters GP(n,1). They may also be constructed as the Cartesian product of a cycle graph with a single edge. As
Prism_graph
On degree sums and Hamiltonian cycles
be Hamiltonian, essentially stating that a graph with sufficiently many edges must contain a Hamilton cycle. Specifically, the theorem considers the sum
Ore's_theorem
Describing a family of graphs by excluding certain (sub)graphs
In graph theory, a branch of mathematics, many important families of graphs can be described by a finite set of individual graphs that do not belong to
Forbidden graph characterization
Forbidden_graph_characterization
Binary operation combining the vertex and edge sets of two graphs
cluster graphs are the disjoint unions of complete graphs. The 2-regular graphs are the disjoint unions of cycle graphs. More generally, every graph is the
Disjoint_union_of_graphs
Derived graph of higher chromatic number
In the mathematical area of graph theory, the Mycielskian or Mycielski graph of an undirected graph is a larger graph formed from it by a construction
Mycielskian
Graph which partitions into a clique and independent set
Split graphs can be characterized in terms of their forbidden induced subgraphs: a graph is split if and only if no induced subgraph is a cycle on four
Split_graph
Graph with sign-labeled edges
is balanced if the product of edge signs around every cycle is positive. The name "signed graph" and the notion of balance appeared first in a mathematical
Signed_graph
Cycle graph with all opposite nodes linked
In graph theory, the Möbius ladder Mn, for even numbers n, is formed from an n-cycle by adding edges (called "rungs") connecting opposite pairs of vertices
Möbius_ladder
Graph whose biconnected components are all cliques
cycle. Block graphs may be characterized as the intersection graphs of the blocks of arbitrary undirected graphs. Block graphs are exactly the graphs
Block_graph
Conjecture in graph theory
In graph theory, Hedetniemi's conjecture, formulated by Stephen T. Hedetniemi in 1966, concerns the connection between graph coloring and the tensor product
Hedetniemi's_conjecture
Graph cycle which does not separate remaining elements
graph theory, a peripheral cycle (or peripheral circuit) in an undirected graph is, intuitively, a cycle that does not separate any part of the graph
Peripheral_cycle
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
Graph of n vertices with a perfect matching for every subgraph of n-1 vertices
In graph theory, a mathematical discipline, a factor-critical graph (or hypomatchable graph) is a graph with an odd number of vertices in which deleting
Factor-critical_graph
Decomposition of a graph into hamiltonion cycles
graph theory, a branch of mathematics, a Hamiltonian decomposition of a given graph is a partition of the edges of the graph into Hamiltonian cycles.
Hamiltonian_decomposition
Structure in computing
procedure g. Thus, a cycle in the graph indicates recursive procedure calls. Call graphs can be dynamic or static. A dynamic call graph is a record of an
Call_graph
Minimum spanning forest algorithm that greedily adds edges
sort all of the graph edges by their weight. A minimum spanning tree of a connected weighted graph is a connected subgraph, without cycles, for which the
Kruskal's_algorithm
Mathematical puzzle
and the reverse of the other solution returns to (0, 0), yielding a cycle graph. If and only if the jugs' volumes are co-prime, every boundary point
Water_pouring_puzzle
Type of graph in graph theory
mathematical field of graph theory, a graph G is said to be hypohamiltonian if G itself does not have a Hamiltonian cycle but every graph formed by removing
Hypohamiltonian_graph
and b, one obtains a word abab... or a word baba....) For example, the cycle graph labeled by a, b, c and d in clock-wise direction is word-representable
Word-representable_graph
Graph of zero divisors of a commutative ring
bipartite graph for any ring that is a product of two integral domains. The only cycle graphs that can be realized as zero-product graphs (with zero
Zero-divisor_graph
CYCLE GRAPH
CYCLE GRAPH
Girl/Female
Hindu, Indian, Traditional
The Periphery or Rim of a Wheel or Cycle
Boy/Male
Spanish American Italian Latin
Enduring. The poet Dante Alighieri wrote The Divine Comedy with its graphic description of...
Boy/Male
Hindu
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Boy/Male
Tamil
Janardana | ஜநாரà¯à®¤à®¨
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Janardana | ஜநாரà¯à®¤à®¨
Boy/Male
Hindu
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Boy/Male
Italian Spanish
Enduring. The poet Dante Alighieri wrote The Divine Comedy with its graphic description of...
Surname or Lastname
German (also Gräff), Dutch, and Jewish (Ashkenazic)
German (also Gräff), Dutch, and Jewish (Ashkenazic) : variant of Graf.English : metonymic occupational name for a clerk or scribe, from Anglo-Norman French grafe ‘quill’, ‘pen’ (a derivative of grafer ‘to write’, Late Latin grafare, from Greek graphein).
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
Jaramarana Varjita | ஜராமாஂரநா வரà¯à®œà¯€à®¤à®¾
Free from the cycle of births and deaths
Jaramarana Varjita | ஜராமாஂரநா வரà¯à®œà¯€à®¤à®¾
Boy/Male
Assamese, Hindu, Indian, Marathi
The Healer; Vishnu; 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
Tamil
Janardhana | ஜநாரà¯à®¤à®¾à®¨à®¾
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Janardhana | ஜநாரà¯à®¤à®¾à®¨à®¾
Boy/Male
Hindu
Free from the cycle of births and deaths
Boy/Male
Hindu
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Boy/Male
Hindu, Indian, Marathi
Vishnu; The Healer; Who Cures the Disease of Birth and Death Cycles
Boy/Male
Italian Spanish
Enduring. The poet Dante Alighieri wrote The Divine Comedy with its graphic description of...
Male
Irish
Irish name CAILTE means "the thin man." This is the name of a character from the Fenian cycle.
Boy/Male
Tamil
Janardan | ஜநாரà¯à®¤à®¨
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
Janardan | ஜநாரà¯à®¤à®¨
Surname or Lastname
English and French
English and French : from a Germanic personal name composed of the elements ragin ‘counsel’ + hard ‘hardy’, ‘brave’, ‘strong’, which was introduced into England by the Normans in the form Re(i)nard. This was the name borne by the cunning fox in the popular medieval cycle of beast tales, with the result that from the 13th century it began to replace the previous Old French word for the animal. Some French examples may be nicknames for crafty individuals, referring to the fox’s reputation for cunning.
Boy/Male
Tamil
Janardhan | ஜநாரà¯à®¤à®¨
Lord Krishna, One who helps people, Liberator from the cycle of birth and death
CYCLE GRAPH
CYCLE GRAPH
Boy/Male
Hindu, Indian
Grace; Favor
Boy/Male
Indian, Sanskrit
Son of the Asvins
Surname or Lastname
English
English : habitational name from any of various places named with Middle English heghen, a weak plural of hegh, from Old English (ge)hæg ‘enclosure’. See also Haynes.English : from the Middle English personal name Hain, Heyne. This is derived from the Germanic personal name Hagano, originally a byname meaning ‘hawthorn’. It is found in England before the Conquest, but was popularized by the Normans. In the Danelaw, it may be derived from Old Norse Hagni, Hǫgni (see Hagan), a Scandinavianized version of the same name.English : nickname for a wretched individual, from Middle English hain(e), heyne ‘wretch’, ‘niggard’.German : topographic name for someone who lived by a patch of enclosed pastureland, Middle High German hage(n) (see Hagen 1), hain, or a habitational name from a place named Hain, from this word.German : from the Germanic personal name Hagin, originally a byname from the same element as in 2 above.Jewish (eastern Ashkenazic) : metronymic from the Yiddish personal name Khaye ‘life’ + the Slavic possessive suffix -in.
Boy/Male
Indian, Sanskrit
To Conquer Completely
Girl/Female
Muslim
Happiness
Boy/Male
Greek
Christ bearer.
Boy/Male
Gaelic Irish
From the narrow forest.
Girl/Female
Australian, British, English, Jamaican, Latin
Virgin; God is Gracious
Boy/Male
Arabic, Farsi, Iranian, Muslim, Parsi
Admiral; Big Gate
Boy/Male
Hindu, Indian, Kannada, Marathi, Sanskrit, Sindhi, Telugu
Surpassing
CYCLE GRAPH
CYCLE GRAPH
CYCLE GRAPH
CYCLE GRAPH
CYCLE GRAPH
n.
The act or practice of using a cycle; cycling.
imp. & p. p.
of Cycle
n.
An age; a long period of time.
n.
An imaginary circle or orbit in the heavens; one of the celestial spheres.
v. i.
To pass through a cycle of changes; to recur in cycles.
v. i.
To pass in cycles; as, the centuries revolve.
a.
Of or pertaining to a cycle or circle; moving in cycles; as, cyclical time.
n.
The circle of subjects connected with the exploits of the hero or heroes of some particular period which have served as a popular theme for poetry, as the legend of Arthur and the knights of the Round Table, and that of Charlemagne and his paladins.
a.
Of or pertaining to, or like, a plasmodium; as, the plasmodial form of a life cycle.
v. i.
To ride a bicycle, tricycle, or other form of cycle.
p. pr. & vb. n.
of Cycle
n.
A cycle of fifteen years.
n.
A cycler.
n.
An orderly list for a given time; a calendar.
n.
A bicycle or tricycle, or other light velocipede.
n.
One entire round in a circle or a spire; as, a cycle or set of leaves.
a.
Pertaining to the Dog Star; as, the cynic, or Sothic, year; cynic cycle.
n.
The act, art, or practice, of riding a cycle, esp. a bicycle or tricycle.
n.
An interval of time in which a certain succession of events or phenomena is completed, and then returns again and again, uniformly and continually in the same order; a periodical space of time marked by the recurrence of something peculiar; as, the cycle of the seasons, or of the year.