AI & ChatGPT searches , social queries for MOORE GRAPH
Search references for MOORE GRAPH. Phrases containing MOORE GRAPH
See searches and references containing MOORE GRAPH!
Search references for MOORE GRAPH. Phrases containing MOORE GRAPH
See searches and references containing MOORE GRAPH!MOORE GRAPH
Regular graph with girth more than twice its diameter
Does a Moore graph with girth 5 and degree 57 exist? More unsolved problems in mathematics In graph theory, a Moore graph is a regular graph whose girth
Moore_graph
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
7-regular undirected graph with 50 nodes and 175 edges
while trying to classify all Moore graphs, and is the highest-order Moore graph known to exist. Since it is a Moore graph where each vertex has degree
Hoffman–Singleton_graph
Cellular automaton neighborhood consisting of eight adjacent cells
Neighbourhood (graph theory) King's graph Chain code Von Neumann neighborhood Weisstein, Eric W. "Moore Neighborhood". MathWorld. Tyler, Tim, The Moore neighborhood
Moore_neighborhood
Longest distance between two vertices
girth is exactly 2 k + 1 {\displaystyle 2k+1} are the Moore graphs. Only finitely many Moore graphs exist, but their exact number is unknown. They provide
Diameter_(graph_theory)
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
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
3-regular graph with 30 vertices and 45 edges
unique smallest cubic graph of girth 8, it is a cage and a Moore graph. It is bipartite, and can be constructed as the Levi graph of the generalized quadrangle
Tutte–Coxeter_graph
American mathematician and computer scientist
given by a regular tree with the same degree. The graphs matching this bound were named Moore graphs by Hoffman & Singleton (1960). With Claude Shannon
Edward_F._Moore
-minor-free graph is an apex graph Does a Moore graph with girth 5 and degree 57 exist? Do there exist infinitely many strongly regular geodetic graphs, or any
List of unsolved problems in mathematics
List_of_unsolved_problems_in_mathematics
Regular graph with fewest possible nodes for its girth
known that an (r, g)-graph exists for any combination of r ≥ 2 and g ≥ 3. It follows that all (r, g)-cages exist. If a Moore graph exists with degree r
Cage_(graph_theory)
Bipartite graph where each node of 1st set is linked to all nodes of 2nd set
nonplanar graph contains either K3,3 or the complete graph K5 as a minor; this is Wagner's theorem. Every complete bipartite graph. Kn,n is a Moore graph and
Complete_bipartite_graph
Graph where each vertex has the same number of neighbors
vertices. Random regular graph Strongly regular graph Moore graph Cage graph Highly irregular graph Chen, Wai-Kai (1997). Graph Theory and its Engineering
Regular_graph
In graph theory, the degree diameter problem is the problem of finding the largest possible graph for a given maximum degree and diameter. The Moore bound
Table of the largest known graphs of a given diameter and maximal degree
Table_of_the_largest_known_graphs_of_a_given_diameter_and_maximal_degree
Balanced complete multipartite graph
graph T(n,2) is a complete bipartite graph and, when n is even, a Moore graph. When r is a divisor of n, the Turán graph is symmetric and strongly regular
Turán_graph
Finding the largest graph of given diameter and degree
bounded above by the Moore bound; for 1 < k and 2 < d, only the Petersen graph, the Hoffman-Singleton graph, and possibly graphs (not yet proven to exist)
Degree_diameter_problem
Matrix representation of a graph
In the mathematical field of graph theory, the Laplacian matrix, also called the graph Laplacian, admittance matrix, Kirchhoff matrix, or discrete Laplacian
Laplacian_matrix
American mathematician (1924–2021)
eigenvalue theory of graphs. Hoffman and Robert Singleton constructed the Hoffman–Singleton graph, which is the unique Moore graph of degree 7 and diameter
Alan_J._Hoffman
Graph with 24 vertices and 36 edges
smallest cubic graph of girth 7). It is also the smallest cubic cage that is not a Moore graph. First discovered by Sachs but unpublished, the graph is named
McGee_graph
Algorithm for finding the shortest paths in graphs
for the same problem, but more versatile, as it is capable of handling graphs in which some of the edge weights are negative numbers. The algorithm was
Bellman–Ford_algorithm
cycle graph (degree two), the Petersen graph (degree three), and the Hoffman–Singleton graph (degree seven). Only one more of these Moore graphs can exist
McKay–Miller–Širáň_graph
Graph property
graphs. The Moore graphs. The collinearity graph of a regular near polygon. The Wells graph and the Sylvester graph. Strongly regular graphs are the distance-regular
Distance-regular_graph
Diagram of behavior of finite state systems
classic form of state diagram for a finite automaton (FA) is a directed graph with the following elements (Q, Σ, Z, δ, q0, F): Vertices Q: a finite set
State_diagram
Writing paper with a grid
Graph paper, coordinate paper, grid paper, or squared paper is writing paper that is printed with fine lines making up a regular grid. It is available
Graph_paper
Type of diagrammatic notation for propositional logic
An existential graph is a type of diagrammatic or visual notation for logical expressions, created by Charles Sanders Peirce, who wrote on graphical logic
Existential_graph
Recursively defined sequence of continuous closed plane fractal curves
has media related to Sierpinski curve. Hilbert curve Koch snowflake Moore graph Murray polygon Peano curve List of fractals by Hausdorff dimension Recursion
Sierpiński_curve
Algorithm to search the nodes of a graph
for the graph itself, which may vary depending on the graph representation used by an implementation of the algorithm. When working with graphs that are
Breadth-first_search
Observation on the growth of integrated circuit capacity
the end of the 1970s, Moore's law became known as the limit for the number of transistors on the most complex chips. The graph at the top of this article
Moore's_law
Graph of king moves on a chessboard
In graph theory, a king's graph is a graph that represents all legal moves of the king chess piece on a chessboard where each vertex represents a square
King's_graph
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
Maximal subgraph whose vertices can reach each other
In graph theory, a component of an undirected graph is a connected subgraph that is not part of any larger connected subgraph. The components of any graph
Component_(graph_theory)
Unsolved problem in computational complexity theory
computer science Can the graph isomorphism problem be solved in polynomial time? More unsolved problems in computer science The graph isomorphism problem is
Graph_isomorphism_problem
Type of discrete calculus
mathematics, calculus on finite weighted graphs is a discrete calculus for functions whose domain is the vertex set of a graph with a finite number of vertices
Calculus on finite weighted graphs
Calculus_on_finite_weighted_graphs
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)
Flow graph invented by Claude Shannon
A signal-flow graph or signal-flowgraph (SFG), invented by Claude Shannon, but often called a Mason graph after Samuel Jefferson Mason who coined the
Signal-flow_graph
Clustering and community detection algorithm
function aggregateGraph returns a new graph whose vertices are the partition of the old graph, and whose edges are calculated using the old graph. This function
Louvain_method
Computational problem of graph theory
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights
Shortest_path_problem
Type of graph in mathematics
specifically in graph theory, a polytree (also called directed tree, oriented tree or singly connected network) is a directed acyclic graph whose underlying
Polytree
Graph that misrepresents data
In statistics, a misleading graph, also known as a distorted graph, is a graph that misrepresents data, constituting a misuse of statistics and with the
Misleading_graph
On the number of spanning trees in a graph
mathematical field of graph theory, Kirchhoff's theorem or Kirchhoff's matrix tree theorem is a theorem about the number of spanning trees in a graph. It states
Kirchhoff's_theorem
Optimization technique
As applied in the field of computer vision, graph cut optimization can be employed to efficiently solve a wide variety of low-level computer vision problems
Graph cuts in computer vision and artificial intelligence
Graph_cuts_in_computer_vision_and_artificial_intelligence
Machine whose output is determined by its state and inputs
to a Mealy automata a Helix directed graph[clarification needed] (S × Σ, (x, i) → (T(x, i), G(x, i))). This graph has as vertices the couples of state
Mealy_machine
while author and former nonprofit CEO Wes Moore won the Democratic nomination. Political observers gave Moore a strong chance of defeating Cox in the general
2022 Maryland gubernatorial election
2022_Maryland_gubernatorial_election
American computer scientist
types of quantum algorithm to solve graph isomorphism, and attack-resistant quantum cryptography. In 2013, Moore became the inaugural member of the Zachary
Cristopher_Moore
Clustering and community detection algorithm
well-connected. Consider, for example, the following graph: Three communities are present in this graph (each color represents a community). Additionally
Leiden_algorithm
Concept in network science
stochastic block model is a generative model for random graphs. This model tends to produce graphs containing communities, subsets of nodes characterized
Stochastic_block_model
Solid with six equal square faces
drawing a graph with vertices connected with an edge in a plane. Such a graph is called the cubical graph, a special case of the hypercube graph. The cube
Cube
Statement in mathematical combinatorics
its graph-theoretic forms, states that one will find monochromatic cliques in any edge labelling (with colours) of a sufficiently large complete graph. As
Ramsey's_theorem
measure, abolishing term limits for all elected positions. The following graph shows the margin of victory of the Democratic Party over the runner-up in
Mayoral elections in Washington, D.C.
Mayoral_elections_in_Washington,_D.C.
algorithm for constructing maximum-cardinality matching on graphs. Coloring algorithm: algorithms for graph (vertex or edge) coloring (subject to constraints,
List_of_algorithms
about these graphs are available in a paper by the author. Family of digraphs found by Faber & Moore (1988). Digraph found by Faber & Moore (1988). The
Table of vertex-symmetric digraphs
Table_of_vertex-symmetric_digraphs
Country in northwestern Europe
archived from the original on 5 July 2019, retrieved 10 December 2019 Tables, Graphs and Maps Interface (TGM) table. Eurostat (26 February 2013). Retrieved 12
United_Kingdom
Intelligence of machines
21), Domingos (2015, Chapter 4) Gradient calculation in computational graphs, backpropagation, automatic differentiation: Russell & Norvig (2021, sect
Artificial_intelligence
President of the United States from 2009 to 2017
Graph of Obama's approval ratings per Gallup
Barack_Obama
Analysis of social structures using network and graph theory
process of investigating social structures through the use of networks and graph theory. It characterizes networked structures in terms of nodes (individual
Social_network_analysis
Country in Central Europe
Czech Hydrometeorological Institute, Prague, 2007. ISBN 80-244-1626-3, graph 2.9. Brázdil, Rudolf; et al. (2019). "Spatiotemporal variability of tornadoes
Czech_Republic
Prism with a 3-sided base
Graph Theoretical Approaches to Chemical Reactivity. Springer. doi:10.1007/978-94-011-1202-4. ISBN 978-94-011-1202-4. Kinsey, L. Christine; Moore, Teresa
Triangular_prism
Search algorithm
Monte-Carlo method to bias search into the largest Voronoi regions of a graph in a configuration space. Some variations can even be considered stochastic
Rapidly_exploring_random_tree
Knowledge Graph which when clicked, makes confetti explode. "panipuri( see it )" will show three types of panipuris in the Knowledge Graph, which when
List_of_Google_Easter_eggs
Instantaneous rate of change (mathematics)
chosen input value, when it exists, is the slope of the tangent line to the graph of the function at that point. The tangent line is the best linear approximation
Derivative
Graph where most nodes are reachable in a small number of steps
network example Hubs are bigger than other nodes A small-world network is a graph characterized by a high clustering coefficient and low distances. In an
Small-world_network
Cellular automaton neighborhood consisting of four adjacent cells
number (sequence A266213 in the OEIS). Moore neighborhood Neighbourhood (graph theory) Taxicab geometry Lattice graph Pixel connectivity Chain code Toffoli
Von_Neumann_neighborhood
Mathematical model of computation
input: The turnstile state machine can also be represented by a directed graph called a state diagram (above). Each state is represented by a node (circle)
Finite-state_machine
Square matrix without an inverse
or apply forces in certain directions. In graph theory and network physics, the Laplacian matrix of a graph is inherently singular (it has a zero eigenvalue)
Singular_matrix
Mathematical parameter in percolation theory
doi:10.1142/S012918310600962X. S2CID 119398198. Mertens, Stephan; Cristopher Moore (2018). "Percolation Thresholds and Fisher Exponents in Hypercubic Lattices"
Percolation critical exponents
Percolation_critical_exponents
On August 7, Stephen Moore made an impromptu presentation at the Oval Office to defend Trump's decision, showing a series of graphs favorable to him. With
False or misleading statements by Donald Trump (second term)
False_or_misleading_statements_by_Donald_Trump_(second_term)
Coronet Films; the Chudnovsky brothers; fractals come from plotting on a graph imaginary numbers against real numbers and have self-similarity, and Ian
List_of_Equinox_episodes
Team sport played with a ball
2007. Retrieved 24 September 2007. Ducker, James (5 December 2023). "Seven graphs that explain the Premier League's goal glut". The Telegraph. Archived from
Association_football
Game of strategy
(the heaps). The evolution graph of the game of nim with three heaps is the same as three branches of the evolution graph of the Ulam–Warburton automaton
Nim
Symbol representing the word "and" (&)
to children in the US and elsewhere. An example may be seen in the M. B. Moore book The Dixie Primer, for the Little Folks (1863). In her novel Adam Bede
Ampersand
2019 environmental documentary film by Jeff Gibbs
produced by Jeff Gibbs. The film was executively produced by Michael Moore. Moore released it on YouTube for free viewing on April 21, 2020, the eve of
Planet_of_the_Humans
Wikipedia linking tendency
separation – Concept of social inter-connectedness Small world network – Graph where most nodes are reachable in a small number of stepsPages displaying
Wikipedia philosophy phenomenon
Wikipedia_philosophy_phenomenon
Topics referred to by the same term
(mathematics), a concept in topology Neighbourhood (graph theory), a grouping in graph theory the Moore neighborhood and Von Neumann neighborhood, used in
Neighbourhood (disambiguation)
Neighbourhood_(disambiguation)
Mathematical function, inverse of an exponential function
shown at the right: a point (t, u = bt) on the graph of f yields a point (u, t = logb u) on the graph of the logarithm and vice versa. As a consequence
Logarithm
Statistical test of whether two populations have equal means
Formula for Degrees of Freedom in the Two-Sample t-Test" (PDF). p. 6. Yates; Moore; Starnes (2008). The Practice of Statistics (3rd ed.). New York: W. H. Freeman
Welch's_t-test
American mathematician (1921–2005)
American mathematician, who specialized in graph theory. He was widely recognized as one of the "fathers" of modern graph theory. Harary was a master of clear
Frank_Harary
Continent
Upper Saddle River, New Jersey: Prentice Hall. ISBN 978-0-13-745852-3. Moore, Clark D., and Ann Dunbar (1968). Africa Yesterday and Today, in series
Africa
governor of Colorado (2011–2019), and candidate for president in 2020 Wes Moore, 63rd governor of Maryland (2023–present) and CEO of the Robin Hood Foundation
2028 United States presidential election
2028_United_States_presidential_election
American social networking service
Gizzard Scala framework for creating distributed datastores, the distributed graph database FlockDB, the Finagle library for building asynchronous RPC servers
X_(social_network)
Country in Central Europe
from the original on 2 May 2023, retrieved 2 May 2023 "Eurostat – Tables, Graphs and Maps Interface (TGM) table". ec.europa.eu. Archived from the original
Austria
First electronic general-purpose digital computer
work on the computer began in secret at the University of Pennsylvania's Moore School of Electrical Engineering the following month, under the code name
ENIAC
Social networking service owned by Meta Platforms
that "Facebook was surprised we were able to suck out the whole social graph, but they didn't stop us once they realised that was what we were doing"
Public high school in Oconto Falls, Wisconsin, USA
This graph was using the legacy Graph extension, which is no longer supported. It needs to be converted to the new Chart extension.
Oconto_Falls_High_School
Discrete model of computation
simulate a two-dimensional cellular automaton is with an infinite sheet of graph paper along with a set of rules for the cells to follow. Each square is
Cellular_automaton
Equivalence of average-case and expected complexity
the evasiveness of graph properties, the number of tests of the adjacency of pairs of vertices needed to determine whether a graph has a given property
Yao's_principle
Overview of and topical guide to deep learning
Energy-based model Generative adversarial network Mixture of experts Graph neural network Graph convolutional network Siamese network Neural Turing machine Memory
Outline_of_deep_learning
Diagrams describing the matter content
In theoretical physics, a quiver diagram is a graph representing the matter content of a gauge theory that describes D-branes on orbifolds. Quiver diagrams
Quiver_diagram
2017". "Iraqi PM congratulates Rouhani on re-election". 24 May 2017. Jack Moore (11 April 2017). "Israel's Defense Minister Avigdor Lieberman 'Wouldn't
2017 Iranian presidential election
2017_Iranian_presidential_election
actor (Scarface, Carlito's Way, Punchline). E. Sampathkumar, 88, Indian graph theorist, lung infection. Annick de Souzenelle, 101, French writer. Talos
Deaths_in_August_2024
Actual play fantasy podcast
Erika Ishii, Aabria Iyengar, Taylor Moore, Brennan Lee Mulligan, Lou Wilson and narrated by the same group (minus Moore). The first campaign, titled The
Worlds_Beyond_Number
(combinatorics) Graph structure theorem (graph theory) Grinberg's theorem (graph theory) Grötzsch's theorem (graph theory) Hajnal–Szemerédi theorem (graph theory)
List_of_theorems
Jason H. Moore is an artificial intelligence (AI) scientist, biomedical informatician, and human geneticist. He is Chair of the Department of Computational
Jason_H._Moore
American fast food franchise
2014.{{cite journal}}: CS1 maint: deprecated archival service (link) "Graph of Shoney's net income since 1974; At Shoney's, details count". The New
Big_Boy_named_franchisees
3SAT, some variants of NAE3SAT in which graphs representing the structure of variables and clauses are planar graphs can be solved in polynomial time. In
Not-all-equal 3-satisfiability
Not-all-equal_3-satisfiability
American conservative political commentator (born 1969)
Graziosi, Graig (December 17, 2021). "Tucker Carlson mocked for using wrong graph to falsely complain women outnumber men in US workforce". The Independent
Tucker_Carlson
American cloud computing company
require a full-time administrator to manage the pipeline. Netlify Graph is a GraphQL-based approach to integrating distinct APIs to build a web app that
Netlify
Mathematical device used in proof of the four colour theorem
189–194. doi:10.1006/jctb.1998.1827. Albertson, M. O.; Moore, E. H. (1999). "Extending Graph Colorings". Journal of Combinatorial Theory, Series B. 77:
Kempe_chain
Major League Baseball team season
Rumors. Retrieved September 26, 2025. "Major League Leaders - Mariners". FanGraphs. Taylor, Paul (June 24, 2025). "Disrespected Mariners veteran is taking
2025_Seattle_Mariners_season
Dopaminergic medication
oral administration of levodopa with large fluctuations (see the schematic graph figure). On the other hand, in a disease like Segawa syndrome, in which
Levodopa
American baseball player (born 1998)
furious comeback". Kansas City Star. "Samad Taylor - Batting Game Logs". FanGraphs. Retrieved November 12, 2024. Kramer, Daniel (January 30, 2024). "Samad
Samad_Taylor
MOORE GRAPH
MOORE GRAPH
Boy/Male
French
Dark skinned.
Girl/Female
Australian, Ghana
More and More
Boy/Male
Arabic, Muslim
More Delicate; More Gracious
Boy/Male
Muslim
More delicate, More gracious
Surname or Lastname
English
English : variant spelling of Moores.Dutch : nickname for a man of swarthy complexion or ethnic name for a North African, from moor ‘Moor’ (see Moore 2).Dutch : patronymic from a short form of the Latin personal name Mauritius (see Morris 1).
Surname or Lastname
English
English : variant spelling of Boor.Possibly a shortened form of Dutch van den Boore, a variant of van den Borne (see Borne).
Boy/Male
American, Australian, British, Christian, Dutch, English, French, German, Irish, Jamaican, Latin
Son of More; Sea-strength; Moor; Dark Skinned
Boy/Male
Muslim/Islamic
More glorious more illustrious
Boy/Male
French English
Dark skinned.
Boy/Male
Irish French
Surname.
Girl/Female
Anglo Saxon Irish Scottish
Bitter.
Boy/Male
British, English, French, Irish
From the Moors; Dark Skinned; Surname
Boy/Male
American, Australian, British, Celtic, English, French, Italian
From the Moors; Dark Skinned
Surname or Lastname
English
English : topographic name for someone who lived on the moors (see Moore 1).English : patronymic from Moore as a personal name (see Moore 3).
Girl/Female
Irish
Great.
Boy/Male
Arabic, Muslim
More Elegant; More Graceful; More Humorous
Boy/Male
Arabic, Muslim
More Delicate; More Gracious
Surname or Lastname
English
English : from Middle English more ‘moor’, ‘marsh’, ‘fen’, ‘area of uncultivated land’ (Old English mÅr), hence a topographic name for someone who lived in such a place or a habitational name from any of the various places named with this word, as for example Moore in Cheshire or More in Shropshire.English : from Old French more ‘Moor’ (Latin maurus). The Latin term denoted a native of northwestern Africa, but in medieval England the word came to be used informally as a nickname for any swarthy or dark-skinned person.English : from a personal name (Latin Maurus ‘Moor’). This name was borne by various early Christian saints. The personal name was introduced to England by the Normans, but it was never as popular in England as it was on the Continent.Irish : Anglicized form of Gaelic Ó Mórdha ‘descendant of Mórdha’, a byname meaning ‘great’, ‘proud’, or ‘stately’.Scottish : see Muir.Welsh : from Welsh mawr ‘big’, applied as a nickname or distinguishing epithet.
Girl/Female
Indian, Telugu
More
Surname or Lastname
English, Irish, Scottish, and Welsh
English, Irish, Scottish, and Welsh : variant spelling of Moore.
MOORE GRAPH
MOORE GRAPH
Girl/Female
Greek
Daughter of Asopus.
Boy/Male
Arabic, Australian, Iranian, Muslim, Parsi
King of Kind; King; Lord
Girl/Female
Greek
Highly regarded.
Surname or Lastname
English
English : variant of Whaley.
Boy/Male
Hindu, Indian
Eraser of Difficulties; God's Wisdom
Boy/Male
Indian
Pious, Beautiful
Girl/Female
Indian
Music
Boy/Male
Indian, Sanskrit
Consuming the Earth; A Son of Bali
Girl/Female
Indian
Clean
Girl/Female
Hindu, Indian, Marathi, Sanskrit
Whiteness
MOORE GRAPH
MOORE GRAPH
MOORE GRAPH
MOORE GRAPH
MOORE GRAPH
n.
Originally, a fine textile fabric made of the hair of an Asiatic goat; afterwards, any textile fabric to which a watered appearance is given in the process of calendering.
adv.
With an adjective or adverb (instead of the suffix -er) to form the comparative degree; as, more durable; more active; more sweetly.
v. t.
To make more; to increase.
n.
That which is in addition; something other and further; an additional or greater amount.
superl.
Greater in number; exceeding in numbers; -- with the plural.
superl.
Greater in quality, amount, degree, quality, and the like; with the singular.
n.
A watered, clouded, or frosted appearance produced upon either textile fabrics or metallic surfaces.
n.
A greater quantity, amount, or number; that which exceeds or surpasses in any way what it is compared with.
adv.
In addition; further; besides; again.
adv.
With a verb or participle.
n.
A large cervine mammal (Alces machlis, or A. Americanus), native of the Northern United States and Canada. The adult male is about as large as a horse, and has very large, palmate antlers. It closely resembles the European elk, and by many zoologists is considered the same species. See Elk.
a.
Of or pertaining to moors; marshy; fenny; boggy; moorish.
imp. & p. p.
of Moor
n.
Land consisting of a moor or moors.
n.
A kind of blue cloth made in India.
adv.
In a greater quantity; in or to a greater extent or degree.
superl.
Additional; other; as, he wept because there were no more words to conquer.
superl.
Greater; superior; increased
v. t.
To fix or secure, as a vessel, in a particular place by casting anchor, or by fastening with cables or chains; as, the vessel was moored in the stream; they moored the boat to the wharf.