For n EN we define the set Zn = {1, 2,... , n - 1} and we define modular product on this set as follows: for x, y, z E Zn: (x.y = z) e (x.y = z mod n). In other words, we get the number z by calculating the product of the numbers x and y as a common product of two of natural numbers and from this product we then calculate the remainder after dividing by the number n. Examples for n = 5 and different values of x and y: In Z3 :3.4 = 2, 2.3 = 1, 2.4 = 3. .. Assignment: We construct the graph G so that its vertices are elements of the set Z101and two vertices corresponding to the elements x and y will be joined by an edge just when the set Z101 holds: x.y = 1 in terms of the modular product defined above. a) Is the graph G regular? b) Is graph G continuous? c) Is graph G a tree? d) What will be the sum of all numbers in the adjacency matrix of graph G?

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%
Hi, I have problem with this assignment, I added it as an image. Thanks
For n EN we define the set Zn = {1, 2,... , n - 1} and we define modular product on this set
as follows:
for x, y, z E Zn: (x.y = z) (x.V = z mod n).
In other words, we get the number z by calculating the product of the numbers x and y as a common
product of two of natural numbers and from this product we then calculate the remainder after
dividing by the number n. Examples for n = 5 and different values of x and y:
In Z; : 3.4 = 2, 2.3 = 1, 2.4 = 3. ..
Assignment: We construct the graph G so that its vertices are elements of the set Z101and two
vertices corresponding to the elements x and y will be joined by an edge just when the set Z101
holds: x.y = 1 in terms of the modular product defined above.
a) Is the graph G regular?
b) Is graph G continuous?
c) Is graph G a tree?
d) What will be the sum of all numbers in the adjacency matrix of graph G?
The answers to all these questions must be duly substantiated, resp. proven.
Transcribed Image Text:For n EN we define the set Zn = {1, 2,... , n - 1} and we define modular product on this set as follows: for x, y, z E Zn: (x.y = z) (x.V = z mod n). In other words, we get the number z by calculating the product of the numbers x and y as a common product of two of natural numbers and from this product we then calculate the remainder after dividing by the number n. Examples for n = 5 and different values of x and y: In Z; : 3.4 = 2, 2.3 = 1, 2.4 = 3. .. Assignment: We construct the graph G so that its vertices are elements of the set Z101and two vertices corresponding to the elements x and y will be joined by an edge just when the set Z101 holds: x.y = 1 in terms of the modular product defined above. a) Is the graph G regular? b) Is graph G continuous? c) Is graph G a tree? d) What will be the sum of all numbers in the adjacency matrix of graph G? The answers to all these questions must be duly substantiated, resp. proven.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 4 steps with 4 images

Blurred answer
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,