rewi's profile - overview

● Good Question   × 1

• How to find the spanning elementary subgraphs of a given graph

● Student   × 1

• how to get a specific eigenvector only for a given eigenvalue of a matrix say of order 2 by 2 or 3 by 3?

● Editor   × 1

• how to find the number of trees on 18 vertices that have diameter=5 and product of 2nd smallest laplacian eigenvalue(algebraic connectivity)and largest laplacian eigenvalue is equal to 1. If we increase the number of vertices say above 18 why it gives no result?

● Enthusiast   × 1

● Commentator   × 1

• How to find the laplacian matrix of a weighted directed graph

● Scholar   × 1

• Graphs having highest second smallest laplacian eigen value from a collection

● Associate Editor   × 1

• How to find an example of a 6 by 6 symmetric matrix (which is not identity matrix and does not satisfy $A^2=\text{ Identity matrix}$) which is similar to its inverse?

● Supporter   × 1

• Graphs having highest second smallest laplacian eigen value from a collection

● Notable Question   × 39

• Example of matrices satisfying certain matrix equation
• How to find the graphs from the following collection whose adjacency spectral radius is maximum?
• Eigenvalues changing at only one position
• Eigenvalues changing at only one position
• How to find the graph(s) with a perfect matching from the following collection whose adjacency spectral radius is maximum?
• How to find the graphs from the following collection whose determinant is maximum?
• Consider the class of simple connected bicyclic graphs on $10$ vertices. Let $A$ be the adjacency matrix of any such graph.
• constructing random connected graph
• Bicyclic Graphs having highest second smallest laplacian eigen value from a collection
• From the following collection how to find only those graphs having only integer eigenvalue
• Solving multiple system of equation in sagemath
• 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 find the tree having largest algebraic connectivity among a given class of trees
• Consider the class of all possible connected simple graphs on $n$ vertices
• 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

● Famous Question   × 25

• How to find the graphs from the following collection whose adjacency spectral radius is maximum?
• Eigenvalues changing at only one position
• Eigenvalues changing at only one position
• How to find the graph(s) with a perfect matching from the following collection whose adjacency spectral radius is maximum?
• constructing random connected graph
• Connected non-bipartite graphs with a unique perfect matching having highest value of determinant
• How to obtain the graph having highest algebraic connectivity?
• Graphs having highest second smallest laplacian eigen value from a collection
• how to find the tree having largest algebraic connectivity among a given class of trees
• Maximum algebraic connectivity from a given collection of graphs
• Graph having largest algebraic connectivity among some given blocks
• finding general term of a sequence
• Spanning elementary subgraphs on a given number of vertices
• How to find the graphs having exactly one perfect matching from the following collection and whose determinant is maximum?
• 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

● Popular Question   × 44

• Solving multiple linear equation in Sagemath
• Example of matrices satisfying certain matrix equation
• How to find the graphs from the following collection whose adjacency spectral radius is maximum?
• Eigenvalues changing at only one position
• Eigenvalues changing at only one position
• How to find the graph(s) with a perfect matching from the following collection whose adjacency spectral radius is maximum?
• Suppose we have a graph. Is it possible to get the laplacian matrix of the graph directly from the given graph? Can one use the degree sequence of the graph for this purpose?
• constructing random connected graph
• Consider the class of simple connected bicyclic graphs on $10$ vertices. Let $A$ be the adjacency matrix of any such graph.
• How to find the graphs from the following collection whose determinant is maximum?
• Solving multiple system of equation in sagemath
• how to find the tree having largest algebraic connectivity among a given class of trees
• Does there exists any simple connected graph $G$ of order $n$, such that whenever $\dfrac{\lambda}{k}$ is an eigenvalue of the adjacency matrix of $G$
• 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

● Nice Question   × 2

• How to find the graphs from the following collection whose adjacency spectral radius is maximum?
• How to find the spanning elementary subgraphs of a given graph