First time here? Check out the FAQ!
Hi there! Please sign in
help
tags
users
badges
ALL
UNANSWERED
Ask Your Question
A's profile - overview
overview
network
karma
followed questions
activity
11
karma
follow
Registered User
real name
Kuldeep Sarma
member since
2017-08-08 07:02:29 -0600
last seen
2018-02-17 04:57:47 -0600
location
India
age
28 years old
todays unused votes
30
votes left
3
Questions
68
views
1
answer
1
vote
2017-10-01 12:12:43 -0600
tmonteil
constructing random connected graph
113
views
2
answers
no
votes
2017-08-18 12:51:49 -0600
kcrisman
how one can obtain eigenvalue and eigenvectors from a list of matrices at a single step
120
views
1
answer
-1
votes
2017-08-28 04:31:32 -0600
A
Write a code for a tree on 9 vertices given in the set {0,1,2,3,4,5,6,7,8} and the edge set of that tree is {(6,1),(1,5),(5,0),(5,3),(3,2),(3,8),(8,4),(8,7)}.
1
Answer
0
Write a code for a tree on 9 vertices given in the set {0,1,2,3,4,5,6,7,8} and the edge set of that tree is {(6,1),(1,5),(5,0),(5,3),(3,2),(3,8),(8,4),(8,7)}.
0
Votes
0
0
1
Tag
homework
× 2
4
Badges
●
Student
×
1
how to get a specific eigenvector only for a given eigenvalue of a matrix say of order 2 by 2 or 3 by 3?
●
Enthusiast
×
1
●
Editor
×
1
how to find the number of trees on 18 vertices that have diameter=5 and product of 2nd smallest laplacian eigenvalue(algebraic connectivity)and largest laplacian eigenvalue is equal to 1. If we increase the number of vertices say above 18 why it gives no result?
●
Commentator
×
1
How to find the laplacian matrix of a weighted directed graph
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a
Creative Commons Attribution Share Alike 3.0
license.
Powered by Askbot version 0.7.56
Please note: Askbot requires javascript to work properly, please enable javascript in your browser,
here is how