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

Jun
19
comment Graphs with 12 edges over the vertices $\{1,2,…,12\}$ have two vertices with a degree of 5
First of all, are you counting up to isomorphism of graphs or are the graphs labelled?
Jun
12
answered How to find the number of spanning trees for a cube?
Jun
2
comment Where to learn Combinatorics & Graph Theory further?
Perhaps you may find useful this (modest) list of exercises from graph theory exwiki.org/mw/index.php?title=Graph_theory
May
30
answered number of cycles in arbitrary graph
May
30
answered Software for computing n-Clique, n-Clan, n-Plex?
May
30
comment number of cycles in arbitrary graph
Hint. If you add an edge to a spanning tree you obtain a cycle. Adding distinct edges gives you distinct cycles.
May
7
comment Looking for algorithms capable of modifying graph structure
@Will You can most likely make a quick Sage function to do what you want
May
6
answered Looking for algorithms capable of modifying graph structure
Apr
27
awarded  Popular Question
Apr
24
awarded  Popular Question
Apr
16
answered Applications Of Strongly Regular Graphs
Apr
13
comment Subgroups of the dihedral group D_n modulo Aut(D_n)
@DerekHolt Derek, thanks that helped. If you're willing to copy paste your comment into an answer I'll upvote& accept it.
Apr
13
comment Edge and vertex connectivity of bipartite graph
Do you see that every vertex of this graph has precisely $n-1$ neighbors? How many vertex/edge disjoint paths are between two vertices in $X$. What about a pair of vertices $x \in X,y \in Y$
Apr
13
comment Edge and vertex connectivity of bipartite graph
The graph you describe is the disjoint union of $n$ edges. Hence if $n > 1$ the graph is not connected. But as I said I think you're confused with the definition and in fact want to consider $K_{n,n}$-matching.
Apr
13
comment Edge and vertex connectivity of bipartite graph
So in this case your graph is a matching which is a disconnected graph for $n > 1.$
Apr
13
comment Edge and vertex connectivity of bipartite graph
Are you sure you don't mean that every vertex has precisely $n-1$ neighbours? That would give you $K_{n,n}$ minus one matching.
Apr
7
comment Subgroups of the dihedral group D_n modulo Aut(D_n)
@DerekHolt Hm.. Why is there no fusion for $n$ odd and why is it enough to consider the automorphism $r \mapsto r$ and $s \mapsto rs$?
Apr
6
asked Subgroups of the dihedral group D_n modulo Aut(D_n)
Apr
4
awarded  Notable Question
Apr
1
asked Minimizing sum of cubes givien some constraints