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
1k
views
2
answers
3
votes
2022-02-06 20:10:05 +0200
rewi
How to find the spanning elementary subgraphs of a given graph
MILP_example
455
views
1
answer
1
vote
2023-01-10 20:57:01 +0200
slelievre
How to find the graphs having exactly one perfect matching from the following collection and whose determinant is maximum?
graph
graph-theory
128
views
1
answer
1
vote
2022-02-07 00:36:39 +0200
slelievre
coefficient of smallest power of $x$ in the adjacency characteristic polynomial of $g$ is $1$
29k
views
1
answer
1
vote
2021-12-16 15:05:34 +0200
Max Alekseyev
How to construct the class of all connected weighted unicyclic graphs on $n$ vertices, where exactly one edge of the cycle in the unicyclic graphs
353
views
1
answer
1
vote
2021-04-07 22:13:31 +0200
Max Alekseyev
How to construct a class of matrices satisfying a given matrix equation.
linear-algebra
216
views
1
answer
1
vote
2020-12-27 00:49:02 +0200
slelievre
Consider the class of all possible connected simple graphs on $n$ vertices
284
views
1
answer
1
vote
2020-12-24 02:04:32 +0200
slelievre
Graphs on 6 vertices with eigenvalue condition
465
views
1
answer
1
vote
2020-06-25 00:57:48 +0200
rburing
Graphs having highest second smallest laplacian eigen value from a collection
556
views
1
answer
1
vote
2019-05-21 12:38:47 +0200
slelievre
Maximum algebraic connectivity from a given collection of graphs
607
views
1
answer
1
vote
2018-11-07 01:49:56 +0200
slelievre
finding general term of a sequence
« 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.
