Full subsets of .
On minimal norms on .
Totally bounded endomorphisms on a topological ring
Orthogonal constant mappings in isosceles orthogonal spaces
A Characterization for 2-Self-Centered Graphs
A graph is called 2-self-centered if its diameter and radius both equal to 2. In this paper, we begin characterizing these graphs by characterizing edge-maximal 2-self-centered graphs via their complements. Then we split characterizing edge-minimal 2-self-centered graphs into two cases. First, we characterize edge-minimal 2-self-centered graphs without triangles by introducing specialized bi-independent covering (SBIC) and a structure named generalized complete bipartite graph (GCBG). Then, we complete...
Page 1