Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
239 views

Chess pieces metrics in higher dimensions

A couple of days ago, I was thinking about applying the knight (the well-known piece of chess) metric to any cubic lattice $\mathbb{N}^k$, $k \in \mathbb{N}-\{0,1\}$. I suddenly realized that, from $k ...
Marco Ripà's user avatar
  • 1,451
1 vote
1 answer
1k views

How many non-isomorphic, simple, connected graphs with 6 vertices are there? [closed]

A graph is called simple if there are no loops and there are no multiple edges. Is it possible to compute the number of non-isomorphic, simple, connected graphs with 6 vertices? If the number is known,...
John Depp's user avatar
  • 331
2 votes
3 answers
284 views

Making integer multisets graphic

Let $M=(X,f)$ be a multiset, where $X$ is the underlying set of elements and $f:X\rightarrow\mathbb{N}$ is the multiplicity function. For every $k\in\mathbb{N}$ put $k\cdot M:=(X,k\cdot f)$. It is ...
Sergiy Kozerenko's user avatar
2 votes
0 answers
75 views

Regular graphs with unimodal subdegrees that are not distance-regular

Distance regular graphs are known to exhibit the following property: starting from an arbitrary vertex $\alpha$, let $k_i$ denote the number of vertices at distance $i$ from $\alpha$ (in terms of ...
Anthony Labarre's user avatar
5 votes
1 answer
384 views

Flow of an integer

I've stumbled across this family of flow networks, and posted the sequence of maximal flows to OEIS: A238729. I can't find any reference to it either. Has anyone seen it? Here is the description: ...
Ken Levasseur's user avatar
7 votes
0 answers
557 views

Graphs with graphic imbalance sequences

Let $G$ be simple undirected graph and $e=uv\in E(G)$. The imbalance of the edge $e$ is the value $imb(e)=|d(u)-d(v)|$. Let $M_{G}$ denotes the imbalance sequence (or more correctly, multiset of ...
Sergiy Kozerenko's user avatar
7 votes
2 answers
964 views

Maximal number of edges and triangular cells for n points in a triangular lattice

Consider a subset of $n$ points in an equilateral triangular lattice. Draw all the edges between nearest-neighbor points. What is the maximum, over all such subsets, of the number of edges? This ...
Keenan Pepper's user avatar