100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
WGU C959: Discrete Math I (Unit 6) With Questions And 100% VERIFIED ANSWERS $11.49   Add to cart

Exam (elaborations)

WGU C959: Discrete Math I (Unit 6) With Questions And 100% VERIFIED ANSWERS

 0 view  0 purchase
  • Course
  • Math discrete
  • Institution
  • Math Discrete

WGU C959: Discrete Math I (Unit 6) With Questions And 100% VERIFIED ANSWERS

Preview 1 out of 2  pages

  • September 30, 2024
  • 2
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers
  • Math discrete
  • Math discrete
avatar-seller
Queenstin
JACKLINE



WGU C959: Discrete Math I (Unit 6) With Questions And
100% VERIFIED ANSWERS


x B x for all x in X; every element has a self-loop

reflexive binary relation



anti-reflexive binary relation no element has a self-loop

x B y and y B z implies x B z for all x, y , z in X

transitive binary relation



x B y implies y B x for all x, y in X; loop forms
between two elements
symmetric binary relation



anti-symmetric binary relation no loops form between two elements

a sequence of alternating vertices and edges that starts and ends with a vertex
Walks in a directed graph
e.g. the flight possibilities between two cities

trail open walk in which no edge occurs more than once

circuit closed walk in which no edge occurs more than once

path a trail in which no vertex occurs more than once

a circuit of length at least 1 in which no vertex occurs more than once, except the
cycle
first and last vertices which are the same

The pair (a, c) is in S o R if and only if there is a "b" in A such that (a, b) is in R and (b,
Composition of relations
c) is in S

Graph Powers: The k-th power of a graph is a new graph created from the original
graph, but with some added edges:
In the original graph, two nodes are connected by an edge if they are directly
Graph Powers
connected (one step away).
In the k-th power of the graph, two nodes are connected by an edge if they are at
most k steps away from each other in the original graph.




1/2

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller Queenstin. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $11.49. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

79373 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$11.49
  • (0)
  Add to cart