1,548 reputation
820
bio website
location
age 26
visits member for 3 years, 8 months
seen 47 mins ago

If you have any good math exercises to share feel free to contribute them on http://exwiki.org


Mar
3
asked Number of edges in graphs having two disjoint cycles of equal length
Mar
3
comment Show that if G is a simple graph with at least 4 vertices and 2n-3 edges, it must have two cycles of the same length.
The claim that a simple graph of order $n$ and at least $n-1$ edges iimplies that $G$ is connected is wrong.
Mar
1
comment How do I find the lowest $k$ for which a graph is $k$-partite?
There is no way to solve this problem in polynomial time. There are various ways to approach this problem depending on the real motivation of this question.
Mar
1
comment How do I find the lowest $k$ for which a graph is $k$-partite?
Maybe I am missing something but aren't you asking about the chromatic number of a graph?
Feb
25
comment When is an induced subgraph of a Johnson graph hamilton-connected?
This question looks like its suitable for mathoverflow.
Feb
24
revised Finding graphs with a given number of spanning trees
deleted 2 characters in body
Feb
24
revised Finding graphs with a given number of spanning trees
added 202 characters in body
Feb
24
answered Finding graphs with a given number of spanning trees
Feb
24
comment Finding graphs with a given number of spanning trees
The question by itself is unsolved. You may find this interesting to you as well mathoverflow.net/questions/93656/… and mathoverflow.net/questions/100816/…
Feb
20
comment A Question about Cayley Graph
See here exwiki.org/mw/…
Feb
13
comment Monochromatic Tree
By any coloring do you mean any proper coloring?
Feb
2
answered Generating Eulerian digraphs/isographs
Feb
1
answered Graph with vertices having certain degrees
Jan
28
comment Given a graph, is there a way to find the number of isomorphisms?
If you want to do it fast in a practical way then it is possible to do so using nauty cs.anu.edu.au/~bdm/nauty I was personally able to compute the automorphism of graphs with thousands of vertices in less than a second.
Jan
28
comment Given a graph, is there a way to find the number of isomorphisms?
Bread is right. In addition I believe the problem is equivalent to the isomorphism problem.
Jan
28
comment Given a graph, is there a way to find the number of isomorphisms?
Do you mean the number of isomorphism from the graph onto itself (that is, the number of automorphisms?)
Jan
27
answered Find out chromatic number of graph if $deg(G) \leq 3$.
Jan
24
accepted A question about the interlacing of symmetric matrices (graph interlacing)
Jan
23
asked A question about the interlacing of symmetric matrices (graph interlacing)
Jan
21
accepted Commuting matrices and simultaneous diagonalizability