AI & ChatGPT searches , social queriess for NAMED GRAPH
Search references for NAMED GRAPH. Phrases containing NAMED GRAPH
See searches and references containing NAMED GRAPH!
Search references for NAMED GRAPH. Phrases containing NAMED GRAPH
See searches and references containing NAMED GRAPH!NAMED GRAPH
Extension of the RDF data model
Named graphs are a key concept of Semantic Web architecture in which a set of Resource Description Framework statements (a graph) are identified using
Named_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
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
Cubic graph with 10 vertices and 15 edges
problems in graph theory. The Petersen graph is named after Julius Petersen, who in 1898 constructed it to be the smallest bridgeless cubic graph with no
Petersen_graph
ASCII-based file format for describing graphs
Graph Modeling Language (GML) is a hierarchical ASCII-based file format for describing graphs. It has been also named Graph Meta Language. A simple graph
Graph_Modelling_Language
Query language for property graphs
GQL (Graph Query Language) is a standardized query language for property graphs first described in ISO/IEC 39075, released in April 2024 by ISO/IEC. The
Graph_Query_Language
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
Graph whose vertices correspond to combinations of a set of n elements
disjoint. Kneser graphs are named after Martin Kneser, who first investigated them in 1956. The Kneser graph K(n, 1) is the complete graph on n vertices
Kneser_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
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
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
Distance-regular graph with 56 vertices
The Gosset graph, named after Thorold Gosset, is a distance-regular graph with 56 vertices and valency 27. It is the 1-skeleton of the 7-dimensional 321
Gosset_graph
Undirected graph with 14 vertices
mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood. The graph is cubic, and
Heawood_graph
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
Database using graph structures for queries
A graph database (GDB) is a database that uses graph structures for semantic queries with nodes, edges, and properties to represent and store data. A key
Graph_database
Format for expressing data in the RDF data model
content is always UTF-8. TriG RDF syntax extends Turtle with support for named graphs. N-Triples Notation3 (N3) LV2 "RDF 1.1 Turtle - Terse RDF Triple LanguageTurtle"
Turtle_(syntax)
Spectral graph theory concept
spectral graph theory, a Ramanujan graph is a regular graph whose spectral gap is almost as large as possible (see extremal graph theory). Such graphs are
Ramanujan_graph
Graph with an Archimedean solid as its skeleton
field of graph theory, an Archimedean graph is a graph that forms the skeleton of one of the Archimedean solids. There are 13 Archimedean graphs, and all
Archimedean_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
Distance-transitive cubic graph with 20 nodes and 30 edges
mathematical field of graph theory, the Desargues graph is a distance-transitive, cubic graph with 20 vertices and 30 edges. It is named after Girard Desargues
Desargues_graph
Triangle-free graph requiring four colors
field of graph theory, the Grötzsch graph is a triangle-free graph with 11 vertices, 20 edges, chromatic number 4, and crossing number 5. It is named after
Grötzsch_graph
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
Cubic graph with 28 vertices and 42 edges
field of graph theory, the Coxeter graph is a 3-regular graph with 28 vertices and 42 edges. It is one of the 13 known cubic distance-regular graphs. It is
Coxeter_graph
Bipartite non-Hamiltonian polyhedral graph
In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges. It is a polyhedral graph (the
Herschel_graph
Two special graphs in graph theory
of genus 3, in which they form dual graphs. This is a 3-regular (cubic) graph with 56 vertices and 84 edges, named after Felix Klein. It is Hamiltonian
Klein_graphs
Matrix representation of a graph
discrete Laplacian, is a matrix representation of a graph. Named after Pierre-Simon Laplace, the graph Laplacian matrix can be viewed as a matrix form of
Laplacian_matrix
for the general theory, as well as Gallery of named graphs for a list with illustrations. R. Diestel, Graph Theory, p.8. 3rd Edition, Springer-Verlag, 2005
List of graphs by edges and vertices
List_of_graphs_by_edges_and_vertices
American software company
TigerGraph is a private company headquartered in Redwood City, California. It provides graph database and graph analytics software. TigerGraph was founded
TigerGraph
16-regular graph with 27 vertices and 216 edges
the mathematical field of graph theory, the Schläfli graph, named after Ludwig Schläfli, is a 16-regular undirected graph with 27 vertices and 216 edges
Schläfli_graph
Path in a graph that visits each vertex exactly once
the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly
Hamiltonian_path
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
Graph divided into two independent sets
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets
Bipartite_graph
24-vertex symmetric bipartite cubic graph
mathematical field of graph theory, the Nauru graph is a symmetric, bipartite, cubic graph with 24 vertices and 36 edges. It was named by David Eppstein after
Nauru_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
Type of knowledge base
knowledge graph is a knowledge base that uses a graph-structured data model or topology to represent and operate on data. Knowledge graphs are often used
Knowledge_graph
Cartesian product of complete graphs
Hamming graphs are a special class of graphs named after Richard Hamming and used in several branches of mathematics (graph theory) and computer science
Hamming_graph
Class of undirected graphs defined from systems of sets
mathematics, Johnson graphs are a special class of undirected graphs defined from systems of sets. The vertices of the Johnson graph J ( n , k ) {\displaystyle
Johnson_graph
Two closely related models for generating random graphs
the mathematical field of graph theory, the Erdős–Rényi models are two closely related models for generating random graphs and the evolution of a random
Erdős–Rényi_model
mathematical field of graph theory, the Robertson graph or (4,5)-cage, is a 4-regular undirected graph with 19 vertices and 38 edges named after Neil Robertson
Robertson_graph
Construction in combinatorial group theory
theory, the Schreier coset graph is a graph associated with a group G, a generating set of G, and a subgroup of G. The Schreier graph encodes the abstract structure
Schreier_coset_graph
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
Bipartite 4-regular graph with 20 nodes and 40 edges
mathematical field of graph theory, the Folkman graph is a 4-regular graph with 20 vertices and 40 edges. It is a regular bipartite graph with symmetries taking
Folkman_graph
In the mathematical field of graph theory, the Tutte graph is a 3-regular graph with 46 vertices and 69 edges named after W. T. Tutte. It has chromatic
Tutte_graph
Undirected unit-distance graph requiring four colors
In graph theory, the Golomb graph is a polyhedral graph with 10 vertices and 18 edges. It is named after Solomon W. Golomb, who constructed it (with a
Golomb_graph
Graph in which all ordered pairs of linked nodes are automorphic
In the mathematical field of graph theory, a graph G is symmetric or arc-transitive if, given any two ordered pairs of adjacent vertices ( u 1 , v 1 )
Symmetric_graph
On forbidden subgraphs in planar graphs
In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski. It states
Kuratowski's_theorem
Graph whose biconnected components are all cliques
In graph theory, a branch of combinatorial mathematics, a block graph or clique tree is a type of undirected graph in which every biconnected component
Block_graph
Creating a new graph from an existing graph
computer science, graph transformation, or graph rewriting, concerns the technique of creating a new graph out of an original graph algorithmically. It
Graph_rewriting
File format
DOT is a graph description language, developed as a part of the Graphviz project. DOT graphs are typically stored as files with the .gv or .dot filename
DOT (graph description language)
DOT_(graph_description_language)
Graph representing incident points and lines
In combinatorial mathematics, a Levi graph or incidence graph is a bipartite graph associated with an incidence structure. From a collection of points
Levi_graph
Set of edges without common vertices
In the mathematical discipline of graph theory, a matching or independent edge set in an undirected graph is a set of edges without common vertices. In
Matching_(graph_theory)
Family of triangle-free circulant graphs
In graph theory, an Andrásfai graph is a triangle-free, circulant graph named after Béla Andrásfai. The Andrásfai graph And(n) for any natural number n
Andrásfai_graph
Graph often embedded in the Klein bottle
mathematical field of graph theory, the Franklin graph is a 3-regular graph with 12 vertices and 18 edges. The Franklin graph is named after Philip Franklin
Franklin_graph
Assignment of labels to elements of a graph
discipline of graph theory, a graph labeling is the assignment of labels, traditionally represented by integers, to edges and/or vertices of a graph. Formally
Graph_labeling
Data query language developed by Facebook
or modified. A GraphQL server can process a client query using data from separate sources and present the results in a unified graph. The language is
GraphQL
Measure of capacity of a communications channel defined from a graph
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 after
Shannon_capacity_of_a_graph
In the mathematical field of graph theory, the Chang graphs are three 12-regular undirected graphs, each with 28 vertices and 168 edges. They are strongly
Chang_graphs
Graph with a triangular truncated trapezohedron as its skeleton
the mathematical field of graph theory, the Dürer graph is an undirected graph with 12 vertices and 18 edges. It is named after Albrecht Dürer, whose
Dürer_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
Number of edges touching a vertex in a graph
In graph theory, the degree (or valency) of a vertex of a graph is the number of edges that are incident to the vertex; in a multigraph, a loop contributes
Degree_(graph_theory)
Planar bipartite graph with 25 vertices and 31 edges
mathematical field of graph theory, the Walther graph, also called the Tutte fragment, is a planar bipartite graph with 25 vertices and 31 edges named after Hansjoachim
Walther_graph
edge-transitive graph which is not also symmetric. Such graphs are not common. It is named after Peter G. Doyle and Derek F. Holt, who discovered the same graph independently
Holt_graph
Gewirtz graph is a strongly regular graph with 56 vertices and valency 10. It is named after the mathematician Allan Gewirtz, who described the graph in his
Gewirtz_graph
Undirected cubic graph with 12 vertices and 18 edges
the mathematical field of graph theory, Tietze's graph is an undirected cubic graph with 12 vertices and 18 edges. It is named after Heinrich Franz Friedrich
Tietze's_graph
Graph generated by a random process
In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability
Random_graph
Undirected unit-distance graph requiring four colors
In graph theory, a branch of mathematics, the Moser spindle (also called the Mosers' spindle or Moser graph) is an undirected graph, named after mathematicians
Moser_spindle
Graph in which every two vertices are adjacent
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique
Complete_graph
One of two different regular graphs with 16 vertices
field of graph theory, the Clebsch graph is either of two complementary graphs on 16 vertices, a 5-regular graph with 40 edges and a 10-regular graph with
Clebsch_graph
Cubic graph with 8 vertices and 12 edges
mathematical field of graph theory, the Wagner graph is a 3-regular graph with 8 vertices and 12 edges. It is the 8-vertex Möbius ladder graph. As a Möbius ladder
Wagner_graph
In the mathematical field of graph theory, the Dyck graph is a 3-regular graph with 32 vertices and 48 edges, named after Walther von Dyck. It is Hamiltonian
Dyck_graph
Trail in a graph that visits each edge once
In graph theory, an Eulerian trail (or Eulerian path) is a trail in a finite graph that visits every edge exactly once (allowing for revisiting vertices)
Eulerian_path
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
Mathematical graph for solving linear systems
In mathematics, the Coates graph or Coates flow graph, named after C.L. Coates, is a graph associated with the Coates' method for the solution of a system
Coates_graph
Mathematical model used by graph-oriented databases
A property graph, labeled property graph, or attributed graph is a data model of various graph-oriented databases, where pairs of entities are associated
Property_graph
Symmetric bipartite cubic graph with 16 vertices and 24 edges
mathematical field of graph theory, the Möbius–Kantor graph is a symmetric bipartite cubic graph with 16 vertices and 24 edges named after August Ferdinand
Möbius–Kantor_graph
format for RDF (Resource Description Framework) graphs. It is a plain text format for serializing named graphs and RDF Datasets which offers a compact and
TriG_(syntax)
Infinite graph without small cliques
Henson graphs have the finite model property? More unsolved problems in mathematics In graph theory, the Henson graph Gi is an undirected infinite graph, the
Henson_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
Database for storage and retrieval of triples
a graph-based RDF model (such as mapping from SPARQL) onto SQL queries is difficult. Adding a name to the triple makes a "quad store" or named graph. A
Triplestore
Subdivision of vertices into disjoint sets
In mathematics, a graph partition is the reduction of a graph to a smaller graph by partitioning its set of nodes into mutually exclusive groups. Edges
Graph_partition
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
Graph with 24 vertices and 36 edges
mathematical field of graph theory, the McGee graph or the (3-7)-cage is a 3-regular graph with 24 vertices and 36 edges. The McGee graph is the unique (3
McGee_graph
regular graph, a distance-transitive graph, and a Ramanujan graph. Although its construction is folklore, it was named after Andries Brouwer and Willem H
Brouwer–Haemers_graph
Undirected graph with 11 nodes and 27 edges
mathematical field of graph theory, the Goldner–Harary graph is a simple undirected graph with 11 vertices and 27 edges. It is named after Anita M. Goldner
Goldner–Harary_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
Structure in computing
A call graph (also known as a call multigraph) is a control-flow graph, which represents calling relationships between subroutines in a computer program
Call_graph
Measure of whether or not a graph has a "bottleneck"
The graph theoretical notion originated after the Cheeger isoperimetric constant of a compact Riemannian manifold. The Cheeger constant is named after
Cheeger constant (graph theory)
Cheeger_constant_(graph_theory)
In mathematics, a topological graph is a representation of a graph in the plane, where the vertices of the graph are represented by distinct points and
Topological_graph
format for RDF (Resource Description Framework) graphs. It is an XML format for serializing Named Graphs and RDF Datasets which offers a compact and readable
TriX_(serialization_format)
6-regular graph with 57 vertices and 171 edges
the Perkel graph, named after Manley Perkel, is a 6-regular graph with 57 vertices and 171 edges. It is the unique distance-regular graph with intersection
Perkel_graph
Planar graph with 23 vertices and 63 edges
edges. Its unique planar embedding has 42 triangular faces. The Kittell graph is named after Irving Kittell, who used it as a counterexample to Alfred Kempe's
Kittell_graph
Balanced complete multipartite graph
The Turán graph, denoted by T ( n , r ) {\displaystyle T(n,r)} , is a complete multipartite graph; it is formed by partitioning a set of n {\displaystyle
Turán_graph
subgroup of order 2 the Suzuki sporadic group. It is named for Michio Suzuki. A. E. Brouwer's website: the Suzuki graph MathWorld: Suzuki graph v t e
Suzuki_graph
These graphs have applications in topology, Tower of Hanoi problems, and interconnection networks for multiprocessor systems. The graphs are named after
Sierpiński_graph
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
Bipartite, 3-regular undirected graph
field of graph theory, the Pappus graph is a bipartite, 3-regular, undirected graph with 18 vertices and 27 edges, formed as the Levi graph of the Pappus
Pappus_graph
Finiteness of sets of forbidden graph minors
graph theory, the Robertson–Seymour theorem (also called the graph minors theorem) states that the undirected graphs, partially ordered by the graph minor
Robertson–Seymour_theorem
Visualization of node-link graphs
Graph drawing is an area of mathematics and computer science combining methods from geometric graph theory and information visualization to derive two-dimensional
Graph_drawing
Graph with 30 vertices and 75 edges
the mathematical field of graph theory, the Meringer graph is a 5-regular undirected graph with 30 vertices and 75 edges named after Markus Meringer. It
Meringer_graph
In mathematics, a fibration of graphs, or graph fibration, is a homomorphism of directed graphs that satisfies a unique lifting property analogous to that
Fibrations_of_graphs
NAMED GRAPH
NAMED GRAPH
Surname or Lastname
Respelling of German Brücker or Brügger, habitational names for someone from any of numerous places in southern Germany, Austria, and Switzerland named Bruck or Brugg, or a topographic name for someone who lived by a bridge (see Brucker).Altered spellin
Respelling of German Brücker or Brügger, habitational names for someone from any of numerous places in southern Germany, Austria, and Switzerland named Bruck or Brugg, or a topographic name for someone who lived by a bridge (see Brucker).Altered spelling of German Brücher, a topographic name for someone who lived by a swamp, from Middle High German bruoch ‘swamp’ + the suffix -er, denoting an inhabitant.English (Somerset) : unexplained; perhaps a variant of Brooker.
Boy/Male
Indian
Praising (God), Loving (God), Friend, Praiser, All-laudable
Biblical
Search for "List of biblical names starting with W"
in existing articles.
Search for "List of biblical names starting with W"
Girl/Female
African, American, Arabic, Australian, Gujarati, Indian, Jain, Japanese, Muslim, Sanskrit, Swahili, Tamil
Name; One's Self; The Victorious; Named Child; Identity
Boy/Male
Arabic, Muslim
Justice; Reward
Boy/Male
Muslim
Praising (God), Loving (God), Friend, Praiser, All-laudable
Girl/Female
Native American
Star dancer.
Biblical
peace; abundance
Female
Native American
Native American Cheyenne name NAMID means "star dancer."
Boy/Male
Arabic, Kurdish
Hopeful; Polite Person; Great Tree; King of World
Surname or Lastname
Altered spelling of the Swiss name Binckli or Bünckli, probably a pet form of the personal name Buno, of unexplained origin.English
Altered spelling of the Swiss name Binckli or Bünckli, probably a pet form of the personal name Buno, of unexplained origin.English : possibly a variant of Bingley.
Biblical
Search for "List of biblical names starting with X"
in existing articles.
Search for "List of biblical names starting with X"
Boy/Male
Muslim/Islamic
A nabee was named by this name
Boy/Male
Afghan, African, Arabic, Australian, French, Indian, Iranian, Muslim, Parsi
One who Praises; Thankful; A Praiser
Boy/Male
Arabic, Hindu, Indian, Muslim, Parsi
Reward; Justice
Surname or Lastname
Americanized spelling of German Kobern, a habitational name from Kowarren, the German form of a place in Lithuania called Kavarskas, named in Lithuanian from kovoti ‘to forge’.English
Americanized spelling of German Kobern, a habitational name from Kowarren, the German form of a place in Lithuania called Kavarskas, named in Lithuanian from kovoti ‘to forge’.English : possibly a variant spelling of Cockburn.
Boy/Male
Muslim
Happy person
Surname or Lastname
Americanized spelling of the French topographic name Garrigue (see Garrigues).Scottish
Americanized spelling of the French topographic name Garrigue (see Garrigues).Scottish : variant of Garioch, a habitational name from the district in Aberdeenshire so named.English : habitational name from Garwick in Lincolnshire, named from an Old English personal name Gǣra + Old English wīc ‘(dairy) farm’.The name is closely associated with the Huguenots. The English actor-manager David Garrick (1717–79) was the grandson of David de la Garrique, who fled Bordeaux in 1685, changing his family name to Garric on arrival in England. Other Garricks (Garicks) were in SC in the 1820s.
Biblical
named; a putting to; 'the name' [of God]
Boy/Male
Indian
Happy person
NAMED GRAPH
NAMED GRAPH
Male
Greek
(Ἀπόλλων) Greek myth name of a god of archery, healing, light, poetry, prophecy, music, and the sun. He is the son of Zeus and Lêtô, and the twin brother of Artemis, goddess of the hunt and moon. According to Æschylus, the name comes from apollumi, APOLLON means "to destroy," hence "the destroyer."Â
Girl/Female
Greek Latin American
God given. Feminine of Theodore.
Girl/Female
Muslim/Islamic
The one and only
Boy/Male
French, German, Italian, Latin
Fidelity; Faithful
Girl/Female
Indian
A Pearl
Surname or Lastname
English
English : variant of Waldron.
Girl/Female
American, Australian, Latin, Swedish
Victorious; Conqueror
Girl/Female
Hindu, Indian, Sanskrit, Tamil
Bright; Brilliant
Male
English
Unisex short form of English Samantha and Samuel, both SAM means "heard of God," "his name is El," or "name of God."
Girl/Female
Hindu
NAMED GRAPH
NAMED GRAPH
NAMED GRAPH
NAMED GRAPH
NAMED GRAPH
a.
Having the frames, stem, and sternpost adjusted; -- said of a ship on the stocks.
n.
A name added, for the sake of distinction, to one's surname, or used instead of it.
a.
Having no clothes on; uncovered; nude; bare; as, a naked body; a naked limb; a naked sword.
a.
So named; called by such a name (but perhaps called thus with doubtful propriety).
n.
To mention by name; to utter or publish the name of; to refer to by distinctive title; to mention.
n.
One who names, or calls by name.
imp. & p. p.
of Lame
a.
Naked as when born.
n.
Those of a certain name; a race; a family.
n.
To give a distinctive name or appellation to; to entitle; to denominate; to style; to call.
imp. & p. p.
of Name
a.
Without addition, exaggeration, or excuses; not concealed or disguised; open to view; manifest; plain.
a.
Not having the full complement of tones; -- said of a chord of only two tones, which requires a third tone to be sounded with them to make the combination pleasing to the ear; as, a naked fourth or fifth.
a.
Without pubescence; as, a naked leaf or stem; bare, or not covered by the customary parts, as a flower without a perianth, a stem without leaves, seeds without a pericarp, buds without bud scales.
imp. & p. p.
of Tame
n.
To designate by name or specifically for any purpose; to nominate; to specify; to appoint; as, to name a day for the wedding.
a.
Unprovided with needful or desirable accessories, means of sustenance, etc.; destitute; unaided; bare.
a.
Mentioned or named before; aforesaid.
n.
To designate (a member) by name, as the Speaker does by way of reprimand.
a.
Mere; simple; plain.