Search Results

Every now and then I wonder what the official name of the relation $\sim$ between two vertices in a graph $G$ is that are mapped to each other by a graph automorphism, i.e. which are "structurally ind …

It's just a wording question: How does one tell - by a simple adjective - that a collection is "of the size of a proper class"? Their might be several sizes of proper classes, but on the ot …

A tree is a graph with no vertex contained in a cycle. A non-tree is a graph with some vertex contained in a cyle. What's the name of graphs with each vertex contained in a cycle?

I wonder if the following graph-theoretical concepts have been considered before, and if so, under which name. Consider a directed graph $G$ with $n$ nodes. Let the cycle number $\gamma(\nu)$ be …

Among the many centrality measures that I have heard of, I miss the following (but maybe I'm just blind). Consider a graph $G$ with $k$ connected components $G_i$ of size $|G_i|$. The number of node p …

Commutative diagrams usually express path equivalences in a category and thus involve pairs of paths in a category with the same source and target. General diagrams - in categories resp. category theo …

I found a seminal paper of renowned authors (Inference of Finite Automata Using Homing Sequences (1993) by Ron Rivest and Robert Schapire) in which the authors define the very same set-theoretic conce …