profile - favorites - ASKSAGE: Sage Q&A Forum

46

views

no

answers

no

votes

2022-07-04 08:11:53 +0200 Anonymous

How to find the graphs having exactly one perfect matching from the following collection? [closed]

no

views

no

answers

no

votes

2022-02-06 20:09:29 +0200 rewi

oefficient of smallest power of $x$ in the adjacency characteristic polynomial of $g$ is $1$ [deleted]

2

views

no

answers

no

votes

2021-12-15 16:32:02 +0200 rewi

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 [closed]

2

views

no

answers

no

votes

2021-12-15 16:31:58 +0200 rewi

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 [closed]

2

views

no

answers

no

votes

2021-12-15 16:31:55 +0200 rewi

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 [closed]

167

views

1

answer

no

votes

2021-10-05 05:44:51 +0200 rewi

Consider the class of simple, connected unicyclic graphs on $n$ vertices (a graph on $n$ vertices is unicyclic, if it has $n$ edges).

129

views

1

answer

no

votes

2021-07-04 17:40:42 +0200 slelievre

How to construct the set of all symmetric invertible $\{0,1\}$ matrices of order 5 in sagemath

176

views

1

answer

no

votes

2021-07-01 23:52:06 +0200 FabianG

Consider the set of all symmetric matrices of a given size $n$ with entries lying in $\{0,1\}$ such that all diagonal entries are zeros in the matrices.

linear-algebra

110

views

no

answers

no

votes

2021-04-23 11:17:39 +0200 slelievre

Matrix solutions to $A^k + B^k = C^k$

993

views

1

answer

no

votes

2020-10-12 16:59:49 +0200 dan_fulea

rewi's profile - followed questions

How to find the graphs having exactly one perfect matching from the following collection? [closed]

oefficient of smallest power of $x$ in the adjacency characteristic polynomial of $g$ is $1$ [deleted]

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 [closed]

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 [closed]

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 [closed]

Consider the class of simple, connected unicyclic graphs on $n$ vertices (a graph on $n$ vertices is unicyclic, if it has $n$ edges).

How to construct the set of all symmetric invertible $\{0,1\}$ matrices of order 5 in sagemath

Consider the set of all symmetric matrices of a given size $n$ with entries lying in $\{0,1\}$ such that all diagonal entries are zeros in the matrices.

Matrix solutions to $A^k + B^k = C^k$

How to find the permutation matrix associated with the similarity transformation in the following code