0

0

0

a positive integer $n$ is called a clt number if every group of order $n$ satisfies the converse of lagrange's theorem. in this note, we find all clt and supersolvable numbers up to $1000$. we also formulate some questions about the distribution of these numbers.

the zarankiewicz number z(b; s) is the maximum size of a subgraph of kb,b which does not contain ks,s as a subgraph. the two-color bipartite ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of kb,b with two colors contains a ks,s in the rst color or a kt,t in the second color.in this work, we design and exploit a computational method for bounding and computin...

(in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps Abstract: Speaker: Anish Arora (Ohio State) Title: Self-Stabilizing Sensor Networks Abstract: Speaker: Alina Bejan (University of Iowa) Title: Designing Self-Optimizing DHTs using Request Profiling Abstract: Various studies on request patterns in P2P networks have confirmed t...

a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...