+1-415-670-9189
info@expertsmind.com
Compute degree centrality of an undirected graph
Course:- Software Engineering
Reference No.:- EM13318245




Assignment Help
Expertsmind Rated 4.9 / 5 based on 47215 reviews.
Review Site
Assignment Help >> Software Engineering

1. Compute the degree centrality, betweeness centrality, closeness centrality of nodes in the following graph.

1116_centrality of nodes in the graph.png

2. A k-regular undirected network is a network in which every vertex has degree ??. Show that the vector ?? = (1, 1, 1, . . . , 1) is an eigenvector of the adjacency matrix with eigenvalue ??.

3. Consider an undirected tree of n vertices. A particular edge in the tree joins vertices 1 and 2 and divides the tree into two disjoint regions of n1 and n2 vertices as sketched here:

771_centrality of nodes in the graph1.png

Show that the closeness centralities ??1 and ??2 of the two vertices are related by

615_centrality of nodes in the graph2.png

4. Calculate the betweenness centrality of the ??th vertex from the end of a "line graph" of n vertices. Here a line graph on n vertices 1, 2, 3,..., n has exactly n - 1 edges that connect vertices ?? and ?? + 1, for ?? = 1,..., n - 1.

1294_centrality of nodes in the graph3.png

5. Write a program in your preferred programming language to compute degree centrality of an undirected graph. The program will read the graph from a file called "graph.txt" and output the degree centrality of nodes to a file called "degree.txt".

The file "graph.txt" includes multiples lines in which the first line contains two integers n and m that correspond to the number of nodes and edges in the graph. Each of the following m lines contain two integers u and v, separated by one space, to denote an edge from u to v. Nodes are numbered from 1 to n.

The output file "degree.txt" contains exactly n lines in which the ????h line is the (unnormalized) degree centrality of node ??.

Your submission must include
- The source file(s)
- The sample input/output
- A README file that describes the compile and running instruction

6. Write a program in your preferred programming language to compute (normalized) closeness centrality of an undirected graph. The program will read the graph from a file called "graph.txt" and output the degree centrality of nodes to a file called "closeness.txt".

The file "graph.txt" includes multiples lines in which the first line contains two integers n and m that correspond to the number of nodes and edges in the graph. Each of the following m lines contain two integers u and v, separated by one space, to denote an edge from u to v. Nodes are numbered from 1 to n.

The output file "closeness.txt" contains exactly n lines in which the ????h line is the (normalized) closeness centrality of node ??.

Your submission must include

- The source file(s)
- The sample input/output
- A README file that describes the compile and running instruction




Put your comment
 
Minimize


Ask Question & Get Answers from Experts
Browse some more (Software Engineering) Materials
Examine and document the change management process for the project. Flowcharts or other visual documentation should be included. Establish a list of requirements for configura
Why would you design a communication diagram instead of sequence diagram? Describe what the arrow which points to the object in a communication diagram signifies.
Assignment: Component Interface for an Emergency Control Room - As the lead software engineer for a medium-sized hospital, you have been asked to spearhead an effort to impr
Design a C++ program to a given detailed specification - Your ability to research technical knowledge required to create the desired program (in this case, optionally, a smal
identify two competing security products such as antivirus software, firewall, anti-spyware, or any hardware. For each product, describe its capabilities, target business us
Discuss why testing is so essential to the development of a new system; list the different types of testing that can be completed and why each one is critical. Can testing b
ITECH7410 Software Engineering Methodologies Assignment - Individual Roots of Polynomials - Quadratic. This assignment requires you to analyse a problem and to design a solut
In software engineering, one can find various life cycle models. Some examples include the waterfall model, agile processes, and iterative and incremental models. Research a