英文字典中文字典


英文字典中文字典51ZiDian.com



中文字典辞典   英文字典 a   b   c   d   e   f   g   h   i   j   k   l   m   n   o   p   q   r   s   t   u   v   w   x   y   z       







请输入英文单字，中文词皆可：

tetrameter    
n. 四音步句

四音步句

tetrameter
n 1: a verse line having four metrical feet

Tetrameter \Te*tram"e*ter\, n. [L. tetrametrus, Gr. ?; te`tra-
(see {Tetra-}) ? a measure: cf. F. t['e]tram[`e]tre.] (GR.
& Latin Pros.)
A verse or line consisting of four measures, that is, in
iambic, trochaic, and anapestic verse, of eight feet; in
other kinds of verse, of four feet.
[1913 Webster]


Verse \Verse\ (v[~e]rs), n. [OE. vers, AS. fers, L. versus a
line in writing, and, in poetry, a verse, from vertere,
versum, to turn, to turn round; akin to E. worth to become:
cf. F. vers. See {Worth} to become, and cf. {Advertise},
{Averse}, {Controversy}, {Convert}, {Divers}, {Invert},
{Obverse}, {Prose}, {Suzerain}, {Vortex}.]
1. A line consisting of a certain number of metrical feet
(see {Foot}, n., 9) disposed according to metrical rules.
[1913 Webster]

Note: Verses are of various kinds, as {hexameter},
{pentameter}, {tetrameter}, etc., according to the
number of feet in each. A verse of twelve syllables is
called an {Alexandrine}. Two or more verses form a
stanza or strophe.
[1913 Webster]

2. Metrical arrangement and language; that which is composed
in metrical form; versification; poetry.
[1913 Webster]

Such prompt eloquence
Flowed from their lips in prose or numerous verse.
--Milton.
[1913 Webster]

Virtue was taught in verse. --Prior.
[1913 Webster]

Verse embalms virtue. --Donne.
[1913 Webster]

3. A short division of any composition. Specifically:
[1913 Webster]
(a) A stanza; a stave; as, a hymn of four verses.
[1913 Webster]

Note: Although this use of verse is common, it is
objectionable, because not always distinguishable from
the stricter use in the sense of a line.
[1913 Webster]
(b) (Script.) One of the short divisions of the chapters
in the Old and New Testaments.
[1913 Webster]

Note: The author of the division of the Old Testament into
verses is not ascertained. The New Testament was
divided into verses by Robert Stephens [or Estienne], a
French printer. This arrangement appeared for the first
time in an edition printed at Geneva, in 1551.
[1913 Webster]
(c) (Mus.) A portion of an anthem to be performed by a
single voice to each part.
[1913 Webster]

4. A piece of poetry. "This verse be thine." --Pope.
[1913 Webster]

{Blank verse}, poetry in which the lines do not end in
rhymes.

{Heroic verse}. See under {Heroic}.
[1913 Webster]


请选择你想看的字典辞典：
单词字典翻译
Tetrameter查看　Tetrameter　在百度字典中的解释百度英翻中〔查看〕
Tetrameter查看　Tetrameter　在Google字典中的解释Google英翻中〔查看〕
Tetrameter查看　Tetrameter　在Yahoo字典中的解释Yahoo英翻中〔查看〕

安装中文字典英文字典查询工具!


中文字典英文字典工具:
选择颜色:
输入中英文单字

































































英文字典中文字典相关资料:


  • 5. 6 Euler Paths and Cycles - University of Pennsylvania
    How can show that every graph with an Euler cycle has no vertices with odd degree? One way to do this is to imagine starting from a graph with no edges, and “traveling” along the Euler cycle, laying down edges one at a time, until we have constructed our original graph
  • Find graphs on 5 vertices with 22 cycles, 13 cycles and 12 cycles
    This task is simple, but is there a solution based on some theory? Not just going through all graphs on 5 vertices
  • List of small graphs - Graph Classes
    5 vertices - Graphs are ordered by increasing number of edges in the left column The list contains all 34 graphs with 5 vertices 5K 1 = K5 D?? P 3 ∪ 2K 1 Do? W4 DQ? claw ∪ K 1 Ds? co-gem DU? K 3 ∪ 2K 1 Dw? 6 vertices - Graphs are ordered by increasing number of edges in the left column The list does not contain all graphs with 6 vertices
  • Walks, Trails, Paths, Cycles and Circuits in Graph
    A path is a trail in which neither vertices nor edges are repeated In other words, when traversing a graph along a path, each vertex and each edge is visited exactly once
  • 1. 5. Cycles — Graph Theory
    Because deg (v) ≥ 2, v has at least two neighbors In other words, the section Q is different from the edge connecting v and v 1 Hence, Q v 1 forms a cycle And it is of length δ (G) + 1 This completes the proof In fact, we have an algorithm to find a cycle without knowing the longest path in G
  • 1 Paths and cycles
    In a tree, the number of vertices equals the number of edges plus one
  • Cycle Graphs - Mathonline
    Notice that all cycle graphs for can be drawn a regular polygons, for example triangles (), squares, parallelograms, and rhombuses (), pentagons (), etc… It is also important to note that cycle graphs all have degree , and each cycle has exactly -edges by The Handshaking Lemma
  • Cycle graph in Graph theory - Tpoint Tech
    Suppose there is a cycle graph in which we have 5 vertices Here, we need to calculate the number of edges and the degree of this graph by using the number of vertices of this graph
  • Cycles - homepages. math. uic. edu
    A cycle in a graph is a set of edges that form a pathway starting at some vertex and eventually returning to the same vertex In the course of traversing the path, each edge of the cycle is used exactly once
  • Mastering Cycles in Graph Theory - numberanalytics. com
    A Hamiltonian cycle is a cycle that visits every vertex in a graph exactly once Hamiltonian cycles are named after the mathematician William Rowan Hamilton, who first studied them in the 19th century





中文字典-英文字典  2005-2009