Let N = {-2,–1,0, 1, 2}. Define a function s: N → N by s(n) = n². Represent this function with a directed graph.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
100%

When faced with a difficult problem in mathematics, it often helps to draw a picture. If the problem involves a discrete collection of interrelated objects, it is natural to sketch the objects and draw lines between them to indicate the relationships. A graph (composed of dots called vertices connected by lines or curves called edges) is the mathematical version of such a sketch. The edges of a graph may have arrows on them; in this case, the graph is called a directed graph.

When we draw a graph, it doesn’t really matter where we put the vertices or whether we draw the edges as curved or straight; rather, what matters is whether or not two given vertices are connected by an edge (or edges). The degree of a vertex is the number of edges incident to it (i.e., the number of times an edge touches it). This is different than the number of edges touching it, because an edge my form a loop; for instance, vertex ? in graph ? (above) has degree 5. In a directed graph, we can speak of the indegree (the number of edges coming in to the vertex) and the outdegree (the number of edges going out). Vertex ? in graph ? (above) has indegree 1 and outdegree 2.

Let ? = {−2,−1, 0, 1, 2}. Define a function ?: ? → ? by ?(?) = ? 2 . Represent this function with a directed graph.

When faced with a difficult problem in mathematics, it often helps to draw a picture. If the problem involves a discrete collection of interrelated objects, it is natural to sketch the objects and draw lines between them to indicate the relationships. A graph (composed of dots called vertices connected by lines or curves called edges) is the mathematical version of such a sketch. The edges of a graph may have arrows on them; in this case, the graph is called a directed graph.

*Figure 1*: G represents a directed graph, whereas H represents an undirected graph.

When we draw a graph, it doesn't really matter where we put the vertices or whether we draw the edges as curved or straight; rather, what matters is whether or not two given vertices are connected by an edge (or edges). The degree of a vertex is the number of edges incident to it (i.e., the number of times an edge touches it). This is different than the number of edges touching it, because an edge from v may form a loop; for instance, vertex a in graph H (above) has degree 5. In a directed graph, we can speak of the indegree (the number of edges coming in to the vertex) and the outdegree (the number of edges going out). Vertex a in graph G (above) has indegree 1 and outdegree 2.

4. Let \( N = \{-2, -1, 0, 1, 2\} \). Define a function \( s: N \rightarrow N \) by \( s(n) = n^2 \). Represent this function with a directed graph.
Transcribed Image Text:When faced with a difficult problem in mathematics, it often helps to draw a picture. If the problem involves a discrete collection of interrelated objects, it is natural to sketch the objects and draw lines between them to indicate the relationships. A graph (composed of dots called vertices connected by lines or curves called edges) is the mathematical version of such a sketch. The edges of a graph may have arrows on them; in this case, the graph is called a directed graph. *Figure 1*: G represents a directed graph, whereas H represents an undirected graph. When we draw a graph, it doesn't really matter where we put the vertices or whether we draw the edges as curved or straight; rather, what matters is whether or not two given vertices are connected by an edge (or edges). The degree of a vertex is the number of edges incident to it (i.e., the number of times an edge touches it). This is different than the number of edges touching it, because an edge from v may form a loop; for instance, vertex a in graph H (above) has degree 5. In a directed graph, we can speak of the indegree (the number of edges coming in to the vertex) and the outdegree (the number of edges going out). Vertex a in graph G (above) has indegree 1 and outdegree 2. 4. Let \( N = \{-2, -1, 0, 1, 2\} \). Define a function \( s: N \rightarrow N \) by \( s(n) = n^2 \). Represent this function with a directed graph.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,