2024-03-23 09:15:23 +0200 | received badge | ● Popular Question (source) |
2024-03-13 21:28:19 +0200 | commented answer | Integer valued eigenvalues I need only those graphs whose adjacency as well as laplacian matrices have all eigenvalues integers. but the code after |
2024-03-13 20:55:55 +0200 | edited question | Integer valued eigenvalues Integer valued eigenvalues . for G in graphs.nauty_geng("8 -c"): A=G.adjacency_matrix().eigenvalues() L=G.lapla |
2024-03-13 20:52:41 +0200 | commented answer | Integer valued eigenvalues But it is not coming the correct answer. |
2024-03-13 20:52:02 +0200 | edited question | Integer valued eigenvalues Integer valued eigenvalues . for G in graphs.nauty_geng("8 -c"): A=G.adjacency_matrix().eigenvalues() L=G.lapla |
2024-03-13 13:05:32 +0200 | asked a question | Integer valued eigenvalues Integer valued eigenvalues for G in graphs.nauty_geng("8 -c"): A=G.adjacency_matrix.eigenvalues() L=G.laplacian_matrix.e |
2023-11-02 19:25:08 +0200 | received badge | ● Notable Question (source) |
2023-09-04 16:37:32 +0200 | received badge | ● Popular Question (source) |
2023-08-22 04:51:00 +0200 | received badge | ● Notable Question (source) |
2023-08-01 11:06:10 +0200 | received badge | ● Notable Question (source) |
2023-07-21 01:24:18 +0200 | received badge | ● Popular Question (source) |
2023-07-07 10:02:14 +0200 | received badge | ● Popular Question (source) |
2023-07-05 14:43:45 +0200 | received badge | ● Popular Question (source) |
2023-06-23 16:07:43 +0200 | received badge | ● Popular Question (source) |
2023-06-23 14:28:54 +0200 | received badge | ● Good Question (source) |
2023-06-16 15:59:57 +0200 | edited question | Matrices with special spectral property Matrices with special spectral property ``` M = MatrixSpace(ZZ,4,4) for A in M: if A.determinant()!=0: p=A.eigen |
2023-06-16 15:57:41 +0200 | asked a question | Matrices with special spectral property Matrices with special spectral property M = MatrixSpace(ZZ,4,4) for A in M: if A.determinant()!=0: p=A.eigen |
2023-06-09 20:51:23 +0200 | received badge | ● Famous Question (source) |
2023-05-31 02:29:59 +0200 | received badge | ● Notable Question (source) |
2023-05-31 02:29:59 +0200 | received badge | ● Popular Question (source) |
2023-05-31 01:37:43 +0200 | received badge | ● Famous Question (source) |
2023-05-27 19:41:09 +0200 | received badge | ● Notable Question (source) |
2023-05-18 12:47:26 +0200 | received badge | ● Popular Question (source) |
2023-05-10 16:49:11 +0200 | received badge | ● Notable Question (source) |
2023-05-03 15:18:13 +0200 | received badge | ● Popular Question (source) |
2023-05-03 06:52:16 +0200 | received badge | ● Popular Question (source) |
2023-04-28 13:57:02 +0200 | asked a question | Bicyclic Graphs with fixed girth having highest second smallest laplacian eigen value from a collection Bicyclic Graphs with fixed girth having highest second smallest laplacian eigen value from a collection for g in graphs. |
2023-04-25 17:16:35 +0200 | edited question | How to obtain (or generate ) positive semidefinite matrices $A,B,C$ that satisfy the matrix equation $A^3+B^3=2C^3$ using a sage code? How to obtain (or generate ) positive semidefinite matrices $A,B,C$ that satisfy the matrix equation $A^3+B^3=2C^3$ usin |
2023-04-25 17:05:07 +0200 | asked a question | How to obtain (or generate ) positive semidefinite matrices $A,B,C$ that satisfy the matrix equation $A^3+B^3=2C^3$ using a sage code? How to obtain (or generate ) positive semidefinite matrices $A,B,C$ that satisfy the matrix equation $A^3+B^3=2C^3$ usin |
2023-04-10 14:13:32 +0200 | received badge | ● Notable Question (source) |
2023-04-10 14:11:07 +0200 | received badge | ● Popular Question (source) |
2023-01-17 18:39:10 +0200 | received badge | ● Notable Question (source) |
2023-01-13 20:05:45 +0200 | commented answer | How to find the graphs having exactly one perfect matching from the following collection and whose determinant is maximum? OK, Thanks. Now suppose I want to find the graphs having exactly one perfect matching from the following collection : Co |
2023-01-11 09:57:53 +0200 | commented answer | How to find the graphs having exactly one perfect matching from the following collection and whose determinant is maximum? Thank you. But I am unable to compile your code. Can you please provide all the codes in a single code so that I can com |
2023-01-11 09:56:47 +0200 | marked best answer | How to find the graphs having exactly one perfect matching from the following collection and whose determinant is maximum? Here I am trying to obtain those graph(s) which have exactly one perfect matching and among all those graphs I need to obtain only that graph(s) whose adjacency matrix have highest determinant. |
2023-01-10 20:20:05 +0200 | asked a question | How to find the graphs having exactly one perfect matching from the following collection and whose determinant is maximum? How to find the graphs having exactly one perfect matching from the following collection and whose determinant is maximu |
2022-10-29 01:52:42 +0200 | received badge | ● Famous Question (source) |
2022-10-16 15:48:47 +0200 | received badge | ● Notable Question (source) |
2022-10-01 04:01:53 +0200 | received badge | ● Popular Question (source) |
2022-08-21 12:18:56 +0200 | received badge | ● Notable Question (source) |
2022-07-15 12:57:23 +0200 | received badge | ● Popular Question (source) |
2022-07-04 09:05:12 +0200 | edited question | How to find the graphs having exactly one perfect matching from the following collection? How to find the graphs having exactly one perfect matching from the following collection? for g in graphs.nauty_geng('8 |
2022-07-04 09:04:46 +0200 | commented question | How to find the graphs having exactly one perfect matching from the following collection? You are correct. I have edited my code now..Can we find now? |
2022-07-04 09:04:11 +0200 | edited question | How to find the graphs having exactly one perfect matching from the following collection? How to find the graphs having exactly one perfect matching from the following collection? for g in graphs.nauty_geng(' - |
2022-07-04 08:11:57 +0200 | asked a question | How to find the graphs having exactly one perfect matching from the following collection? How to find the graphs having exactly one perfect matching from the following collection? for g in graphs.nauty_geng('7 |
2022-07-04 08:11:53 +0200 | asked a question | How to find the graphs having exactly one perfect matching from the following collection? How to find the graphs having exactly one perfect matching from the following collection? for g in graphs.nauty_geng('7 |