## Registered User | |
---|---|

real name | Kuldeep Sarma |

member since | 2017-08-08 14:02:29 +0100 |

last seen | 2021-01-14 15:10:33 +0100 |

location | India |

age, years | 31 |

todays unused votes | 30 votes left |

9

0

- graph× 5
- graph-theory× 5
- inverse× 3
- homework× 2
- MILP_example× 2

● Associate Editor
×
1 ● Editor
×
1 ● Nice Question
×
1

● Student × 1 ● Popular Question × 12

● Scholar × 1 ● Enthusiast × 1

● Notable Question × 8

● Student × 1 ● Popular Question × 12

- Graphs on 6 vertices with eigenvalue condition
- Graphs having highest second smallest laplacian eigen value from a collection
- Maximum algebraic connectivity from a given collection of graphs
- How to get a graph from a given symmetric matrix
- finding general term of a sequence
- How to find the permutation matrix associated with the similarity transformation in the following code
- How to find the laplacian matrix of a weighted directed graph
- factorise a polynomial
- extraction of principal submatrices
- How to find the spanning elementary subgraphs of a given graph
- how one can obtain eigenvalue and eigenvectors from a list of matrices at a single step
- How to find the similarity matrix between two similar matrices

● Scholar × 1 ● Enthusiast × 1

● Notable Question × 8

- Graphs on 6 vertices with eigenvalue condition
- extraction of principal submatrices
- How to find the permutation matrix associated with the similarity transformation in the following code
- How to get a graph from a given symmetric matrix
- how one can obtain eigenvalue and eigenvectors from a list of matrices at a single step
- How to find the laplacian matrix of a weighted directed graph
- How to find the spanning elementary subgraphs of a given graph
- How to find the similarity matrix between two similar matrices

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.