| ||||
| ||||
![]() Title:Dominance Shadow Topology Conference:TMREES26Lb Tags:Alexandroff Space, Dirac’s Condition, Dominance Shadow Topology, Graph-induced Topology and Shadow Matrix Abstract: This paper investigates the Dominance Shadow Topology ($\tau_{\text{shadow}}$), generated from a graph via a subbase where vertex $u$ is in $v$’s shadow if $u$’s degree equals or exceeds their graph distance. We show this topology strongly tends toward extreme collapse (indiscrete or discrete) rather than intermediate structures. For cycles $C_n$, we prove a complete dichotomy: $\tau_{\text{shadow}}$ is indiscrete for $3 \le n \le 5$ and fully discrete for $n \ge 6$. Dense graphs satisfying Dirac’s condition collapse to the indiscrete space. Graph disconnection always forces topological disconnection, while the converse generally fails for regular graphs. Furthermore, $k$-regularity is sufficient, but not necessary, for symmetry of the shadow matrix. Extended to directed graphs, discreteness occurs even faster: directed cycles become discrete at $n \ge 3$, and out-regularity loses its matrix symmetry guarantee. Finally, a MATLAB implementation computes the subbase, basis, and topology for any graph. Dominance Shadow Topology ![]() Dominance Shadow Topology | ||||
| Copyright © 2002 – 2026 EasyChair |
