GMATH

• a graph with no

  loops and no two

  of its links join

  the same pair of

  vertices?

  Simple graph
• a graph with just one vertex

  all other graphs are called NONTRIVIAL?


  Trivial graph
• is a simple graph in

  which each pair of distinct vertices is joined

  by an edge.?

  Complete Graph
• is a graph with no edges.?

  empty graph
• Is the science that deal with the collection, presentation, analysis, and interpretation of data>?

  Statistics
• dEALS WITH THE GATHERING, presentation and analysis of data without generalizing the result of the popultaion?

  Descriptive statistics
• Concerns with he generalization of the sample results for the whole population?

  Inferential Statistics
• Is a representative part of a population?

  Sample
• Is the process of selecting units?

  Sampling
• Every case in the population being sampled has an equal chance of being chosen?

  Simple Random Sampling
• Examples of simple random sampling?

  • Draw lots
  • Lottery
  • Usage of gadgets like the calculator or computer to generate Random Numbers
  • Table of Random Numbers
• Method consist of choosing of randomly selecting one unit and choosing additional elements?

  Systematic sampling
• It is the difference between the largest and smallest

  values.?

  Range
• are the most

  common and useful measures of variability.?

  Variance and Standard deviation
• The value in the distribution with the highest frequency.?

  Mode
• A value that divides the distribution into two equal parts?

  Median
• Are values below which a specific fraction or percentage of the observations in a given set must fall?

  Fractiles or Quantiles
• Are values that divide a set of observation into 100 equal parts?

  Percentiles
• Are values that divide a set of observation into 10 equal parts?

  Deciles
• Are values that divide a set of observation into 4 equal parts?

  Quartiles
• collection of vertices (also

  called points or nodes) and edges (or

  lines).?

  Graph
• The set V(G) is called?

  vERTEX
• The set E(G) is called?

  EDGE
• The number of vertices in a graph G is

  called?

  ORDER (p)
• The number of edges on a graph G is called?

  SIZE (q)
• The ends of an edge are said to be?

  INCIDENT
• Two vertices which are incident with a

  common edge?

  ADJACENT
• An edge with identical ends is called a?

  LOOP
• An edge with distinct ends is called a?

  LINK
• in a graph G is an

  alternating sequence?

  WALK
• a walk in which no edge is repeated?

  TRAIL
• A trail in which no vertex is repeated?

  PATH
• is a walk in which n≥3, v0 = vn and

  the n vertices are distinct.?

  CYCLES
• A trail that traverses every edge of G is

  called?

  EULER TRAIL
• is a tour which

  traverses each edge exactly once?

  EULER TOUR
• if it contains an

  Euler tour?


  EULERIAN
• A nonempty connected graph is

  eulerian if and only if it has no

  vertices of odd degree.
• A path that contains every vertex of G is

  called?

  HAMILTONIAN PATH
• is a cycle that

  contains every vertex of a graph?

  HAMILTONIAN CYCLE