Reputation
2,016
Top tag
Next privilege 2,500 Rep.
Create tag synonyms
Badges
10 25
Impact
~43k people reached

Oct
4
comment Approaching of area and perimeter of a regular polygon to that of a circle
BTW, this question is not about graph theory :)
Oct
3
comment How would I prove that the determinant reduced Laplacian of a graph is independent of the choice of $i$?
What is wrong with using Kirchhoff theorem then? You can quickly prove it using induction. See mathoverflow.net/questions/73385/…
Oct
3
answered How would I prove that the determinant reduced Laplacian of a graph is independent of the choice of $i$?
Sep
29
answered Basic Questions in Graph Theory
Sep
28
asked Computing the number of positive and negative eigenvalues
Sep
7
comment Graph chromatic number and graph homomorphism?
@user93620 Also take a look at the Mycielski construction en.wikipedia.org/wiki/Mycielskian
Sep
6
comment Diameter of a Connected Graph
For the second question see here exwiki.org/mw/…
Sep
6
comment Complete graph invariant
@ChrisGodsil In this case one just has to change in the above code : graphs.nauty_geng(str(n)): to graphs.cospectral_graphs(n)
Sep
5
revised Complete graph invariant
added 71 characters in body
Sep
5
answered Complete graph invariant
Sep
4
accepted A variant of the Schwartz–Zippel lemma
Sep
1
comment What can we say about two graphs if they have similar adjacency matrices?
Also if your graphs are regular then they have the same number of spanning trees as well.
Sep
1
comment What can we say about two graphs if they have similar adjacency matrices?
Given two such graphs you can say that they have the same number of edges and triangles.
Aug
30
answered A variant of the Schwartz–Zippel lemma
Aug
29
comment A variant of the Schwartz–Zippel lemma
@IgorShinkar As far as I understand this problem, yes. This is taken from an exercise section of a book, so I don't have any additional info except for what is written.
Aug
28
comment Is there any way to count cycles of given size by that graph's spectrum?
Though, according to some result in the back of my mind it is possible to count the number of $4$-cycles of a graph given its spectrum and degree sequence.
Aug
28
answered Number of non-isomorphic connected graphs with m edges.
Aug
28
comment A variant of the Schwartz–Zippel lemma
@IgorShinkar $f_2$ is actually $f_1$ - the coefficient of $x_1^{d_1}$ in $f.$
Aug
28
revised A variant of the Schwartz–Zippel lemma
edited body
Aug
28
asked A property of linear (error correcting) codes