Skip to main content

All Questions

4 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
6 votes
0 answers
116 views

The properties of almost all directed graphs

A mathematician on the forum previously requested a reference on human brains modelled as directed graphs. This makes sense as neurons are mostly unidirectional and I have been thinking about similar ...
Aidan Rocke's user avatar
  • 3,871
1 vote
0 answers
72 views

Another betweenness centrality measure: neighbourhood centrality

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 ...
Hans-Peter Stricker's user avatar
1 vote
0 answers
372 views

counting k-cliques not also (k+1) on random graphs

consider the set of graphs with $n$ vertices and exactly half of all $\binom n 2$ possible edges. looking for a formula that counts the number of these graphs that have a $k$-clique but not a $(k+...
vzn's user avatar
  • 529
0 votes
0 answers
107 views

Maximum Independent set of sparse graphs with few triangles

Notations used $\alpha(G) = $ Max sized independent set of graph $G$. $n(G) = $ Number of vertex in graph $G$. Theorem (by Ajtai et al.): For a triangle-free graph $G$ and max degree being $\Delta$,...
Vivek Bagaria's user avatar