暗記メーカー

暗記メーカー

​
ログイン

Math 1

Math 1
43問 • 2年前
  • Jian Estelle
    • 通報

    問題一覧

  • 1

    is a branch of mathematics created to solve problems involving the most efficient way to travel between different directions.

    Graph Theory

  • 2

    it was developed after _____ solved an eighteenth century problem in solving the seven bridges of _____ in a city now called _____ in a modern Russia.

    Graph Theory, Leonhard Euler, Pregel River, Kaliningrad

  • 3

    is a set of points called ____ and line segments or curves called ____ that connect vertices.

    Graph, Vertices or Nodes, Edges

  • 4

    is an edge that begins and ends at the same vertex.

    Loop

  • 5

    is a line connecting two vertices called endpoints.

    Edge

  • 6

    is the number of its vertices.

    Order of a Graph

  • 7

    is the number of edges that intersect the vertex.

    Degree of a Vertex

  • 8

    has an even number of edges that intersect the vertex.

    Even Vertex

  • 9

    has an odd number of edges that intersect the vertex.

    Odd Vertex

  • 10

    pair of vertices joined by an edge.

    Adjacent Vertices

  • 11

    term describing an edge if its joined to a vertex.

    Incident

  • 12

    edge that begins and ends at the same vertex.

    Loop

  • 13

    has two distinct endvertices.

    Link

  • 14

    graph with multiple edges; allowing more than one edge to connect between two vertices; such edges are called multiple edges.

    Multigraph

  • 15

    graph with loops and multiple edges.

    Pseudograph

  • 16

    alternating sequences of vertices and edges, with each edge being incident to the vertices immediately preceding and succeeding it in the sequence.

    Walk

  • 17

    walk with no repeated edges.

    Trail

  • 18

    walk with no repeated vertices.

    Path

  • 19

    walk with its initial vertex as also its terminal vertex.

    Closed Walk

  • 20

    walk with its initial vertex different from its terminal vertex.

    Open Walk

  • 21

    closed trail with at least one edge and no repeated vertices except that the initial vertex is the terminal vertex.

    Cycle

  • 22

    length of a shortest (simple) cycle in the graph.

    Girth of a Graph

  • 23

    length of the longest cycle in the graph.

    Circumference of a Walk

  • 24

    number of edges in the sequence defining the walk; thus the length of a path or cycle is also the number of edges in the path or cycle.

    Length of a Walk

  • 25

    graph in which every pair of its vertices is connected by a path; otherwise, the graph is disconnected.

    Connected Graph

  • 26

    A graph that is disconnected two or more pieces.

    Components of the Graph

  • 27

    vertex whose removal disconnects the remaining subgraph.

    Cut Vertex or Cut Point

  • 28

    edge whose removal disconnects the graph.

    Bridge or Cut Edge

  • 29

    it can be drawn without any break in the curve and without repeating any edges.

    Traversable Graph

  • 30

    A trail or circuit (or cycle) is ____ if it uses all edges precisely once.

    Eulerian

  • 31

    A graph that contains an Eulerian trail is ____.

    Traversable

  • 32

    A graph is ____ if and only if the degree of each vertex is even.

    Eulerian

  • 33

    is a graph whose edges have directions.

    Directed Graph

  • 34

    In a digraph, a pair of edges in which one is directed from vertex a to vertex b and the other is directed from vertex b to vertex a.

    Parallel Edges

  • 35

    is a vertex with 0 in-degree.

    Source

  • 36

    is a vertex with 0 out-degree.

    Sink

  • 37

    it associates a value (weight) with every edge in the graph

    Weighted Graph

  • 38

    is a simple graph that if u and v are vertices in T, there exists a unique simple walk from u to v.

    Tree T

  • 39

    is connected and an acyclic graph.

    Tree

  • 40

    a graph with no cycle.

    Tree

  • 41

    a tree in which a particular vertex is designed as a root.

    Rooted Tree

  • 42

    length of simple path from the root to a vertex v

    Level of a Tree

  • 43

    maximum level number

    Weight of the Tree

    • Pg 1. Radio-and-Television

    Pg 1. Radio-and-Television

    Jian Estelle · 23問 · 2年前

    Pg 1. Radio-and-Television

    Pg 1. Radio-and-Television

    23問 • 2年前
    Jian Estelle

    Business Finance

    Business Finance

    Jian Estelle · 201問 · 3年前

    Business Finance

    Business Finance

    201問 • 3年前
    Jian Estelle

    Pg 3.

    Pg 3.

    Jian Estelle · 19問 · 2年前

    Pg 3.

    Pg 3.

    19問 • 2年前
    Jian Estelle

    Chart

    Chart

    Jian Estelle · 142問 · 3年前

    Chart

    Chart

    142問 • 3年前
    Jian Estelle

    ENTREPRENEURSHIP

    ENTREPRENEURSHIP

    Jian Estelle · 34問 · 3年前

    ENTREPRENEURSHIP

    ENTREPRENEURSHIP

    34問 • 3年前
    Jian Estelle

    Pg 2.

    Pg 2.

    Jian Estelle · 31問 · 2年前

    Pg 2.

    Pg 2.

    31問 • 2年前
    Jian Estelle

    CONTRIBUTORS

    CONTRIBUTORS

    Jian Estelle · 16問 · 3年前

    CONTRIBUTORS

    CONTRIBUTORS

    16問 • 3年前
    Jian Estelle

    CSCI

    CSCI

    Jian Estelle · 102問 · 3年前

    CSCI

    CSCI

    102問 • 3年前
    Jian Estelle

    Pg 2.

    Pg 2.

    Jian Estelle · 31問 · 2年前

    Pg 2.

    Pg 2.

    31問 • 2年前
    Jian Estelle

    Filipino Value System

    Filipino Value System

    Jian Estelle · 23問 · 2年前

    Filipino Value System

    Filipino Value System

    23問 • 2年前
    Jian Estelle

    belief system (1)

    belief system (1)

    Jian Estelle · 36問 · 2年前

    belief system (1)

    belief system (1)

    36問 • 2年前
    Jian Estelle

    belief system (2)

    belief system (2)

    Jian Estelle · 32問 · 2年前

    belief system (2)

    belief system (2)

    32問 • 2年前
    Jian Estelle

    belief system (3)

    belief system (3)

    Jian Estelle · 17問 · 2年前

    belief system (3)

    belief system (3)

    17問 • 2年前
    Jian Estelle

    Ethics belief system

    Ethics belief system

    Jian Estelle · 85問 · 2年前

    Ethics belief system

    Ethics belief system

    85問 • 2年前
    Jian Estelle

    Marketing

    Marketing

    Jian Estelle · 49問 · 2年前

    Marketing

    Marketing

    49問 • 2年前
    Jian Estelle

    Mktg Steps

    Mktg Steps

    Jian Estelle · 6問 · 2年前

    Mktg Steps

    Mktg Steps

    6問 • 2年前
    Jian Estelle

    mktg #1

    mktg #1

    Jian Estelle · 16問 · 2年前

    mktg #1

    mktg #1

    16問 • 2年前
    Jian Estelle

    mktg #2

    mktg #2

    Jian Estelle · 18問 · 2年前

    mktg #2

    mktg #2

    18問 • 2年前
    Jian Estelle

    mktg #3

    mktg #3

    Jian Estelle · 15問 · 2年前

    mktg #3

    mktg #3

    15問 • 2年前
    Jian Estelle

    Eco

    Eco

    Jian Estelle · 66問 · 2年前

    Eco

    Eco

    66問 • 2年前
    Jian Estelle

    Unit 1 eco

    Unit 1 eco

    Jian Estelle · 36問 · 2年前

    Unit 1 eco

    Unit 1 eco

    36問 • 2年前
    Jian Estelle

    Unit 2 Eco

    Unit 2 Eco

    Jian Estelle · 30問 · 2年前

    Unit 2 Eco

    Unit 2 Eco

    30問 • 2年前
    Jian Estelle

    Industries

    Industries

    Jian Estelle · 18問 · 2年前

    Industries

    Industries

    18問 • 2年前
    Jian Estelle

    enumeration

    enumeration

    Jian Estelle · 9問 · 2年前

    enumeration

    enumeration

    9問 • 2年前
    Jian Estelle

    identification

    identification

    Jian Estelle · 25問 · 2年前

    identification

    identification

    25問 • 2年前
    Jian Estelle

    Math 0

    Math 0

    Jian Estelle · 53問 · 2年前

    Math 0

    Math 0

    53問 • 2年前
    Jian Estelle

    for Quiz 1

    for Quiz 1

    Jian Estelle · 70問 · 2年前

    for Quiz 1

    for Quiz 1

    70問 • 2年前
    Jian Estelle

    Math 1

    Math 1

    Jian Estelle · 43問 · 2年前

    Math 1

    Math 1

    43問 • 2年前
    Jian Estelle

    Quiz 2

    Quiz 2

    Jian Estelle · 29問 · 2年前

    Quiz 2

    Quiz 2

    29問 • 2年前
    Jian Estelle

    Math 1 (2)

    Math 1 (2)

    Jian Estelle · 37問 · 2年前

    Math 1 (2)

    Math 1 (2)

    37問 • 2年前
    Jian Estelle

    Quiz 1

    Quiz 1

    Jian Estelle · 40問 · 2年前

    Quiz 1

    Quiz 1

    40問 • 2年前
    Jian Estelle

    jejdjsn

    jejdjsn

    Jian Estelle · 52問 · 2年前

    jejdjsn

    jejdjsn

    52問 • 2年前
    Jian Estelle

    NSTP

    NSTP

    Jian Estelle · 15問 · 2年前

    NSTP

    NSTP

    15問 • 2年前
    Jian Estelle

    nstp

    nstp

    Jian Estelle · 27問 · 2年前

    nstp

    nstp

    27問 • 2年前
    Jian Estelle

    CE 100

    CE 100

    Jian Estelle · 12問 · 2年前

    CE 100

    CE 100

    12問 • 2年前
    Jian Estelle

    math 3

    math 3

    Jian Estelle · 16問 · 2年前

    math 3

    math 3

    16問 • 2年前
    Jian Estelle

    Quiz 3

    Quiz 3

    Jian Estelle · 45問 · 2年前

    Quiz 3

    Quiz 3

    45問 • 2年前
    Jian Estelle

    Q3 Classification

    Q3 Classification

    Jian Estelle · 19問 · 2年前

    Q3 Classification

    Q3 Classification

    19問 • 2年前
    Jian Estelle

    Q3 Enumeration

    Q3 Enumeration

    Jian Estelle · 5問 · 2年前

    Q3 Enumeration

    Q3 Enumeration

    5問 • 2年前
    Jian Estelle

    Q3 Identification

    Q3 Identification

    Jian Estelle · 48問 · 2年前

    Q3 Identification

    Q3 Identification

    48問 • 2年前
    Jian Estelle

    G1

    G1

    Jian Estelle · 28問 · 2年前

    G1

    G1

    28問 • 2年前
    Jian Estelle

    Enumeration

    Enumeration

    Jian Estelle · 7問 · 2年前

    Enumeration

    Enumeration

    7問 • 2年前
    Jian Estelle

    Advancements

    Advancements

    Jian Estelle · 18問 · 2年前

    Advancements

    Advancements

    18問 • 2年前
    Jian Estelle

    Advancement of Engineering

    Advancement of Engineering

    Jian Estelle · 10問 · 2年前

    Advancement of Engineering

    Advancement of Engineering

    10問 • 2年前
    Jian Estelle

    Advancement of Science

    Advancement of Science

    Jian Estelle · 8問 · 2年前

    Advancement of Science

    Advancement of Science

    8問 • 2年前
    Jian Estelle

    Periods and Era

    Periods and Era

    Jian Estelle · 13問 · 2年前

    Periods and Era

    Periods and Era

    13問 • 2年前
    Jian Estelle

    G2

    G2

    Jian Estelle · 22問 · 2年前

    G2

    G2

    22問 • 2年前
    Jian Estelle

    3,4,5

    3,4,5

    Jian Estelle · 15問 · 2年前

    3,4,5

    3,4,5

    15問 • 2年前
    Jian Estelle

    Quiz 2 (1)

    Quiz 2 (1)

    Jian Estelle · 23問 · 2年前

    Quiz 2 (1)

    Quiz 2 (1)

    23問 • 2年前
    Jian Estelle

    Quiz 2 (2)

    Quiz 2 (2)

    Jian Estelle · 31問 · 2年前

    Quiz 2 (2)

    Quiz 2 (2)

    31問 • 2年前
    Jian Estelle

    quiz 3

    quiz 3

    Jian Estelle · 33問 · 2年前

    quiz 3

    quiz 3

    33問 • 2年前
    Jian Estelle

    Quiz 2 (3)

    Quiz 2 (3)

    Jian Estelle · 10問 · 2年前

    Quiz 2 (3)

    Quiz 2 (3)

    10問 • 2年前
    Jian Estelle

    Quiz 2 (4)

    Quiz 2 (4)

    Jian Estelle · 19問 · 2年前

    Quiz 2 (4)

    Quiz 2 (4)

    19問 • 2年前
    Jian Estelle

    Nation-states roles

    Nation-states roles

    Jian Estelle · 19問 · 2年前

    Nation-states roles

    Nation-states roles

    19問 • 2年前
    Jian Estelle

    Acronyms

    Acronyms

    Jian Estelle · 48問 · 2年前

    Acronyms

    Acronyms

    48問 • 2年前
    Jian Estelle

    quiz 3

    quiz 3

    Jian Estelle · 21問 · 2年前

    quiz 3

    quiz 3

    21問 • 2年前
    Jian Estelle

    SS1

    SS1

    Jian Estelle · 107問 · 2年前

    SS1

    SS1

    107問 • 2年前
    Jian Estelle

    E1

    E1

    Jian Estelle · 62問 · 2年前

    E1

    E1

    62問 • 2年前
    Jian Estelle

    MT0

    MT0

    Jian Estelle · 36問 · 2年前

    MT0

    MT0

    36問 • 2年前
    Jian Estelle

    E1 mam

    E1 mam

    Jian Estelle · 40問 · 2年前

    E1 mam

    E1 mam

    40問 • 2年前
    Jian Estelle

    SS1 Enumeration

    SS1 Enumeration

    Jian Estelle · 19問 · 2年前

    SS1 Enumeration

    SS1 Enumeration

    19問 • 2年前
    Jian Estelle

    E2

    E2

    Jian Estelle · 61問 · 2年前

    E2

    E2

    61問 • 2年前
    Jian Estelle

    15-20 pg

    15-20 pg

    Jian Estelle · 76問 · 2年前

    15-20 pg

    15-20 pg

    76問 • 2年前
    Jian Estelle

    International and Local

    International and Local

    Jian Estelle · 69問 · 2年前

    International and Local

    International and Local

    69問 • 2年前
    Jian Estelle

    pg 20

    pg 20

    Jian Estelle · 14問 · 2年前

    pg 20

    pg 20

    14問 • 2年前
    Jian Estelle

    pg21 (19)

    pg21 (19)

    Jian Estelle · 25問 · 2年前

    pg21 (19)

    pg21 (19)

    25問 • 2年前
    Jian Estelle

    pg 22

    pg 22

    Jian Estelle · 11問 · 2年前

    pg 22

    pg 22

    11問 • 2年前
    Jian Estelle

    20-22 pg

    20-22 pg

    Jian Estelle · 50問 · 2年前

    20-22 pg

    20-22 pg

    50問 • 2年前
    Jian Estelle

    4.1

    4.1

    Jian Estelle · 32問 · 2年前

    4.1

    4.1

    32問 • 2年前
    Jian Estelle

    4.2

    4.2

    Jian Estelle · 38問 · 2年前

    4.2

    4.2

    38問 • 2年前
    Jian Estelle

    pg 23-25

    pg 23-25

    Jian Estelle · 44問 · 2年前

    pg 23-25

    pg 23-25

    44問 • 2年前
    Jian Estelle

    pg 25-27

    pg 25-27

    Jian Estelle · 47問 · 2年前

    pg 25-27

    pg 25-27

    47問 • 2年前
    Jian Estelle

    Math 1

    Math 1

    Jian Estelle · 49問 · 2年前

    Math 1

    Math 1

    49問 • 2年前
    Jian Estelle

    5.1 doc

    5.1 doc

    Jian Estelle · 9問 · 2年前

    5.1 doc

    5.1 doc

    9問 • 2年前
    Jian Estelle

    5.1

    5.1

    Jian Estelle · 54問 · 2年前

    5.1

    5.1

    54問 • 2年前
    Jian Estelle

    5.2 doc

    5.2 doc

    Jian Estelle · 20問 · 2年前

    5.2 doc

    5.2 doc

    20問 • 2年前
    Jian Estelle

    5.3

    5.3

    Jian Estelle · 10問 · 2年前

    5.3

    5.3

    10問 • 2年前
    Jian Estelle

    4.1

    4.1

    Jian Estelle · 33問 · 2年前

    4.1

    4.1

    33問 • 2年前
    Jian Estelle

    4.2

    4.2

    Jian Estelle · 30問 · 2年前

    4.2

    4.2

    30問 • 2年前
    Jian Estelle

    5.1

    5.1

    Jian Estelle · 40問 · 2年前

    5.1

    5.1

    40問 • 2年前
    Jian Estelle

    5.2

    5.2

    Jian Estelle · 18問 · 2年前

    5.2

    5.2

    18問 • 2年前
    Jian Estelle

    5.3

    5.3

    Jian Estelle · 5問 · 2年前

    5.3

    5.3

    5問 • 2年前
    Jian Estelle

    additional definitions

    additional definitions

    Jian Estelle · 24問 · 2年前

    additional definitions

    additional definitions

    24問 • 2年前
    Jian Estelle

    Poetry

    Poetry

    Jian Estelle · 34問 · 2年前

    Poetry

    Poetry

    34問 • 2年前
    Jian Estelle

    Figures of Speech

    Figures of Speech

    Jian Estelle · 11問 · 2年前

    Figures of Speech

    Figures of Speech

    11問 • 2年前
    Jian Estelle

    Drama

    Drama

    Jian Estelle · 10問 · 2年前

    Drama

    Drama

    10問 • 2年前
    Jian Estelle

    eng

    eng

    Jian Estelle · 30問 · 2年前

    eng

    eng

    30問 • 2年前
    Jian Estelle

    person

    person

    Jian Estelle · 9問 · 2年前

    person

    person

    9問 • 2年前
    Jian Estelle

    M6

    M6

    Jian Estelle · 26問 · 2年前

    M6

    M6

    26問 • 2年前
    Jian Estelle

    e+

    e+

    Jian Estelle · 24問 · 2年前

    e+

    e+

    24問 • 2年前
    Jian Estelle

    eng2

    eng2

    Jian Estelle · 23問 · 2年前

    eng2

    eng2

    23問 • 2年前
    Jian Estelle

    eng 3

    eng 3

    Jian Estelle · 39問 · 2年前

    eng 3

    eng 3

    39問 • 2年前
    Jian Estelle

    mentioned

    mentioned

    Jian Estelle · 39問 · 2年前

    mentioned

    mentioned

    39問 • 2年前
    Jian Estelle

    問題一覧

  • 1

    is a branch of mathematics created to solve problems involving the most efficient way to travel between different directions.

    Graph Theory

  • 2

    it was developed after _____ solved an eighteenth century problem in solving the seven bridges of _____ in a city now called _____ in a modern Russia.

    Graph Theory, Leonhard Euler, Pregel River, Kaliningrad

  • 3

    is a set of points called ____ and line segments or curves called ____ that connect vertices.

    Graph, Vertices or Nodes, Edges

  • 4

    is an edge that begins and ends at the same vertex.

    Loop

  • 5

    is a line connecting two vertices called endpoints.

    Edge

  • 6

    is the number of its vertices.

    Order of a Graph

  • 7

    is the number of edges that intersect the vertex.

    Degree of a Vertex

  • 8

    has an even number of edges that intersect the vertex.

    Even Vertex

  • 9

    has an odd number of edges that intersect the vertex.

    Odd Vertex

  • 10

    pair of vertices joined by an edge.

    Adjacent Vertices

  • 11

    term describing an edge if its joined to a vertex.

    Incident

  • 12

    edge that begins and ends at the same vertex.

    Loop

  • 13

    has two distinct endvertices.

    Link

  • 14

    graph with multiple edges; allowing more than one edge to connect between two vertices; such edges are called multiple edges.

    Multigraph

  • 15

    graph with loops and multiple edges.

    Pseudograph

  • 16

    alternating sequences of vertices and edges, with each edge being incident to the vertices immediately preceding and succeeding it in the sequence.

    Walk

  • 17

    walk with no repeated edges.

    Trail

  • 18

    walk with no repeated vertices.

    Path

  • 19

    walk with its initial vertex as also its terminal vertex.

    Closed Walk

  • 20

    walk with its initial vertex different from its terminal vertex.

    Open Walk

  • 21

    closed trail with at least one edge and no repeated vertices except that the initial vertex is the terminal vertex.

    Cycle

  • 22

    length of a shortest (simple) cycle in the graph.

    Girth of a Graph

  • 23

    length of the longest cycle in the graph.

    Circumference of a Walk

  • 24

    number of edges in the sequence defining the walk; thus the length of a path or cycle is also the number of edges in the path or cycle.

    Length of a Walk

  • 25

    graph in which every pair of its vertices is connected by a path; otherwise, the graph is disconnected.

    Connected Graph

  • 26

    A graph that is disconnected two or more pieces.

    Components of the Graph

  • 27

    vertex whose removal disconnects the remaining subgraph.

    Cut Vertex or Cut Point

  • 28

    edge whose removal disconnects the graph.

    Bridge or Cut Edge

  • 29

    it can be drawn without any break in the curve and without repeating any edges.

    Traversable Graph

  • 30

    A trail or circuit (or cycle) is ____ if it uses all edges precisely once.

    Eulerian

  • 31

    A graph that contains an Eulerian trail is ____.

    Traversable

  • 32

    A graph is ____ if and only if the degree of each vertex is even.

    Eulerian

  • 33

    is a graph whose edges have directions.

    Directed Graph

  • 34

    In a digraph, a pair of edges in which one is directed from vertex a to vertex b and the other is directed from vertex b to vertex a.

    Parallel Edges

  • 35

    is a vertex with 0 in-degree.

    Source

  • 36

    is a vertex with 0 out-degree.

    Sink

  • 37

    it associates a value (weight) with every edge in the graph

    Weighted Graph

  • 38

    is a simple graph that if u and v are vertices in T, there exists a unique simple walk from u to v.

    Tree T

  • 39

    is connected and an acyclic graph.

    Tree

  • 40

    a graph with no cycle.

    Tree

  • 41

    a tree in which a particular vertex is designed as a root.

    Rooted Tree

  • 42

    length of simple path from the root to a vertex v

    Level of a Tree

  • 43

    maximum level number

    Weight of the Tree