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

real name | rewi das |

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

last seen | 2024-06-30 22:25:06 +0200 |

location | India |

age, years | 34 |

todays unused votes | 30 votes left |

18

0

- graph-theory× 20
- graph× 8
- inverse× 3
- homework× 2
- MILP_example× 2
- linear× 1
- algebra× 1

● Student
×
1 ● Famous Question
×
11

● Popular Question × 31

● Editor × 1 ● Enthusiast × 1

● Commentator × 1 ● Scholar × 1 ● Supporter × 1

- Weighted adjacency matrix of a graph.
- 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
- Bicyclic Graphs with fixed girth having highest second smallest laplacian eigen value from a collection
- extraction of principal submatrices
- 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
- How to find the permutation matrix associated with the similarity transformation in the following code
- Graphs on 6 vertices with eigenvalue condition
- How to get a graph from a given symmetric matrix

- Connected non-bipartite graphs with a unique perfect matching having highest value of determinant
- How to find the graphs having exactly one perfect matching from the following collection?
- Matrices with special spectral property
- How to find the graphs having exactly one perfect matching from the following collection and whose determinant is maximum?
- How to obtain the graph having highest algebraic connectivity?
- Graph having largest algebraic connectivity among some given blocks
- How to construct a class of matrices satisfying a given matrix equation.
- 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
- Bicyclic Graphs with fixed girth having highest second smallest laplacian eigen value from a collection
- Line graph of a given graph
- Spanning elementary subgraphs on a given number of vertices
- Maximum algebraic connectivity from a given collection of graphs
- Weighted adjacency matrix of a graph.
- how to get a specific eigenvector only for a given eigenvalue of a matrix say of order 2 by 2 or 3 by 3?
- Graphs having highest second smallest laplacian eigen value from a collection
- finding general term of a sequence
- factorise a polynomial
- How to find the similarity matrix between two similar matrices
- How to find the spanning elementary subgraphs of a given graph
- How to find the laplacian matrix of a weighted directed graph
- how one can obtain eigenvalue and eigenvectors from a list of matrices at a single step
- How to get a graph from a given symmetric matrix
- How to find the permutation matrix associated with the similarity transformation in the following code
- extraction of principal submatrices
- Graphs on 6 vertices with eigenvalue condition

● Popular Question × 31

- Consider the class of simple, connected unicyclic graphs on $n$ vertices (a graph on $n$ vertices is unicyclic, if it has $n$ edges).
- From the following collection how to find only those graphs having only integer eigenvalue
- Connected non-bipartite graphs with a unique perfect matching having highest value of determinant
- Integer valued eigenvalues
- How to find the graphs having exactly one perfect matching from the following collection?
- Graph having largest algebraic connectivity among some given blocks
- How to find the graphs having exactly one perfect matching from the following collection and whose determinant is maximum?
- Consider the class of all possible connected simple graphs on $n$ vertices
- Matrices with special spectral property
- How to construct a class of matrices satisfying a given matrix equation.
- 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
- Bicyclic Graphs with fixed girth having highest second smallest laplacian eigen value from a collection
- 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?
- Bicyclic Graphs having highest second smallest laplacian eigen value from a collection
- How to obtain the graph having highest algebraic connectivity?
- Line graph of a given graph
- Spanning elementary subgraphs on a given number of vertices
- how to get a specific eigenvector only for a given eigenvalue of a matrix say of order 2 by 2 or 3 by 3?
- Weighted adjacency matrix of a graph.
- How to find the similarity matrix between two similar matrices
- how one can obtain eigenvalue and eigenvectors from a list of matrices at a single step
- How to find the spanning elementary subgraphs of a given graph
- extraction of principal submatrices
- factorise a polynomial
- How to find the laplacian matrix of a weighted directed graph
- How to find the permutation matrix associated with the similarity transformation in the following code
- finding general term of a sequence
- How to get a graph from a given symmetric matrix
- Maximum algebraic connectivity from a given collection of graphs
- Graphs having highest second smallest laplacian eigen value from a collection
- Graphs on 6 vertices with eigenvalue condition

● Editor × 1 ● Enthusiast × 1

● Commentator × 1 ● Scholar × 1 ● Supporter × 1

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.