Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Assume that you are provided a list {k1,k2, ... , kN} with arbitrary integer values. Is there any c) case in which this list cannot represent an actual network? If yes, provide an example of a list of degrees that cannot correspond to an actual network and explain why it cannot exist. If not, justify carefully why it should always be possible.

Assume that you are provided a list {k1,k2, ... , kN} with arbitrary integer values. Is there any c) case in which this list cannot represent an actual network? If yes, provide an example of a list of degrees that cannot correspond to an actual network and explain why it cannot exist. If not, justify carefully why it should always be possible.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question

please send solution for Q3 part c

3. Configuration Model The configuration model is a model for random graphs that works in the following way. You start with an arbitrary network with N nodes. For each of these nodes find the value of its degree. Now, in order to generate another network, you reconnect the links at random such that the degree of each node remains the same. There are no additional restrictions. a) Write a pseudo-code that would implement this algorithm starting with a given graph where the nodes have degree {k,, k2, ..., kN}. The pseudo-code has to have enough details for a reader to reproduce the algorithm. For instance, you should specify which variables are being used to store information, initial values and how they are modified during the implementation of the algorithm. Explain what kind of graphs you could obtain by using this model (directed/undirected, b) connected/disconnected, simple graphs, multi-graphs?) Assume that you are provided a list {k1,k2, ...,kN} with arbitrary integer values. Is there any c) case in which this list cannot represent an actual network? If yes, provide an example of a list of degrees that cannot correspond to an actual network and explain why it cannot exist. If not, justify carefully why it should always be possible.
Transcribed Image Text:3. Configuration Model The configuration model is a model for random graphs that works in the following way. You start with an arbitrary network with N nodes. For each of these nodes find the value of its degree. Now, in order to generate another network, you reconnect the links at random such that the degree of each node remains the same. There are no additional restrictions. a) Write a pseudo-code that would implement this algorithm starting with a given graph where the nodes have degree {k,, k2, ..., kN}. The pseudo-code has to have enough details for a reader to reproduce the algorithm. For instance, you should specify which variables are being used to store information, initial values and how they are modified during the implementation of the algorithm. Explain what kind of graphs you could obtain by using this model (directed/undirected, b) connected/disconnected, simple graphs, multi-graphs?) Assume that you are provided a list {k1,k2, ...,kN} with arbitrary integer values. Is there any c) case in which this list cannot represent an actual network? If yes, provide an example of a list of degrees that cannot correspond to an actual network and explain why it cannot exist. If not, justify carefully why it should always be possible.
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS