First time here? Check out the FAQ!
Hi there! Please sign in
help
tags
users
badges
ALL
UNANSWERED
Ask Your Question
rewi's profile - followed questions
overview
network
karma
followed questions
activity
568
views
1
answer
no
votes
2020-03-25 22:47:52 +0200
vdelecroix
How to find an example of a 6 by 6 symmetric matrix (which is not identity matrix and does not satisfy $A^2=\text{ Identity matrix}$) which is similar to its inverse?
inverse
535
views
1
answer
no
votes
2020-02-06 19:54:52 +0200
Emmanuel Charpentier
Weighted adjacency matrix of a graph.
176
views
1
answer
no
votes
2019-07-11 18:57:37 +0200
rewi
From the following collection how to find only those graphs having only integer eigenvalue
40
views
1
answer
no
votes
2019-07-03 22:06:20 +0200
vdelecroix
From the following collection how to find only those graphs having only integer eigenvalues? [deleted]
125
views
no
answers
no
votes
2019-06-23 09:08:57 +0200
FrédéricC
How to obtain the eigenvector for the following graph?
273
views
2
answers
no
votes
2019-04-03 09:37:52 +0200
David Coudert
Bicyclic Graphs having highest second smallest laplacian eigen value from a collection [closed]
12
views
no
answers
no
votes
2019-03-27 20:16:17 +0200
rewi
bicyclic graph eigenvalue [deleted]
352
views
1
answer
no
votes
2019-03-15 09:13:35 +0200
slelievre
How to construct the following matrix
92
views
1
answer
no
votes
2019-02-12 10:13:55 +0200
rburing
How to get only the connected graphs from this code
2k
views
2
answers
no
votes
2018-07-11 13:08:31 +0200
slelievre
How to get a graph from a given symmetric matrix
« previous
1
...
1
2
3
4
5
...
5
next »
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.59
Please note: Askbot requires javascript to work properly, please enable javascript in your browser,
here is how
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.
