Question

In an adjacency matrix representation of graph, if the matrix is symmetric and all diagonal values...

In an adjacency matrix representation of graph, if the matrix is symmetric and all diagonal values are 0, then the graph is a simple graph.

Yes

No

Engineering   Computer-Science   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

Answer:

No

Conditions for simple graph

1.There shouldn't be self loop

2.There shouldn't be parallel edges

if the matrix contain 0's on the diagnal from left to right that means the graph dont contain self loop

But if the graph is symetric but the weight is greater than 1 of any side then the graph is not a simple graph

example

020

202

020

in the above exaple the graph contains 0's on diagnols

and it is symetric

but it is not a simple graph becuase it contains parallel edges

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
JAVA Describe an efficient algorithm that converts the Adjacency list representation of a graph to the...
JAVA Describe an efficient algorithm that converts the Adjacency list representation of a graph to the Adjacency matrix representation of the same graph. What is the running time? 1. Use pseudocode. 2. What is the running time? Example: Input: The adjacency list is: Adj[0] -> 2 Adj[1] -> 2 Adj[2] -> 0 -> 1 Output: arr[][] = [ [0, 0, 1], [0, 0, 1], [1, 1, 0] ]
What happens to the adjacency matrix of a graph if this graph consists of two subgraphs...
What happens to the adjacency matrix of a graph if this graph consists of two subgraphs that are not connected to each other? Can you make a general statement? Does this statement cover both directed and undirected graphs?
Python 3 question Suppose that a directed and weighted graph represented as adjacency matrix, how could...
Python 3 question Suppose that a directed and weighted graph represented as adjacency matrix, how could it perform uniform cost search by using priority queue?
n×n-matrix M is symmetric if M = M^t. Matrix M is anti-symmetric if M^t = -M....
n×n-matrix M is symmetric if M = M^t. Matrix M is anti-symmetric if M^t = -M. 1. Show that the diagonal of an anti-symmetric matrix are zero 2. suppose that A,B are symmetric n × n-matrices. Prove that AB is symmetric if AB = BA. 3. Let A be any n×n-matrix. Prove that A+A^t is symmetric and A - A^t antisymmetric. 4. Prove that every n × n-matrix can be written as the sum of a symmetric and anti-symmetric matrix.
3.35 Show that if A is an m x m symmetric matrix with its eigenvalues equal...
3.35 Show that if A is an m x m symmetric matrix with its eigenvalues equal to its diagonal elements, then A must be a diagonal matrix.
Describe a software application that would require a graph data structure in its implementation. Explain what...
Describe a software application that would require a graph data structure in its implementation. Explain what the vertices and edges of the graph would represent. Would the graph be undirected or directed? Would it be weighted or unweighted? Decide which type of representation would be best for this application, an adjacency matrix, an adjacency list using an array of linked lists or a fully linked representation. Explain your reasoning.
Prove: If A is an n × n symmetric matrix all of whose eigenvalues are nonnegative,...
Prove: If A is an n × n symmetric matrix all of whose eigenvalues are nonnegative, then xTAx ≥ 0 for all nonzero x in the vector space Rn.
Problem 4. Let Λ be a diagonal matrix, with all λi,i > 0. Consider a measurable...
Problem 4. Let Λ be a diagonal matrix, with all λi,i > 0. Consider a measurable E ⊂ Rd . Define ΛE = {Λx : x ∈ E}. Prove that ΛE is measurable and m(ΛE) = [det(Λ)]m(E).
A matrix A is symmetric if AT = A and skew-symmetric if AT = -A. Let...
A matrix A is symmetric if AT = A and skew-symmetric if AT = -A. Let Wsym be the set of all symmetric matrices and let Wskew be the set of all skew-symmetric matrices (a) Prove that Wsym is a subspace of Fn×n . Give a basis for Wsym and determine its dimension. (b) Prove that Wskew is a subspace of Fn×n . Give a basis for Wskew and determine its dimension. (c) Prove that F n×n = Wsym ⊕Wskew....
Suppose A is an orthogonal matrix. Show that |λ| = 1 for all eigen- values λ....
Suppose A is an orthogonal matrix. Show that |λ| = 1 for all eigen- values λ. (Hint: start off with an eigenvector and dot-product it with itself. Then cleverly insert A and At into the dot-product.) b) Suppose P is an orthogonal projection. Show that the only possible eigenvalues are 0 and 1. (Hint: start off with an eigenvector and write down the definition. Then apply P to both sides.) An n×n matrix B is symmetric if B = Bt....
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT