Tootfinder

Opt-in global Mastodon full text search. Join the index!

@cellfourteen@social.petertoushkov.eu
2024-05-04 10:09:54

OCD activated via @…
catodon.social/notes/9svfgul6e

A still from a morning TV show, in which the host is seemingly looking at the untied shoestring of her guest, a modern dressed young girl, former contestant in Eurovision. There's diagrams and math symbols and a dashed line arrow along the line of sight of the host.

Salif (@sal)
Връзката на обувката ѝ беше развързана. Питам защо. ЗАЩО?? :BlobCat_Eyes: #РазвързанаОбувка #ChildishPlanet 📎

@juandesant@astrodon.social
2024-04-25 10:41:59
Content warning: Manipulated computer board imagery by Nanoraptor. May trigger people with OCD.

This is great, but please don’t click through if you’re OCD…
bitbang.social/@NanoRaptor/112

NanoRaptor (@NanoRaptor@bitbang.social)
Attached: 1 image They just don't put thought into design like they used to. The longer you look, the calmer you feel.

@mikemathia@ioc.exchange
2024-02-11 02:26:20

#OCD

@arXiv_mathCO_bot@mastoxiv.page
2024-02-19 08:22:00

This arxiv.org/abs/1112.0846 has been replaced.
link: scholar.google.com/scholar?q=a<…

On the number of outer connected dominating sets of graphs
Let $G=(V,E)$ be a simple graph. A set $S\subseteq V(G)$ is called an outer-connected dominating set (or ocd-set) of $G$, if $S$ is a dominating set of $G$ and either $S=V(G)$ or $V\backslash S$ is a connected graph. In this paper we introduce a polynomial which its coefficients are the number of ocd-sets of $G$. We obtain some properties of this polynomial and its coefficients. Also we compute this polynomial for some specific graphs.