|
|
Close Help | ||||||||||||||
Ping Zhang, Department of Mathematics and Statistics, Western Michigan University, Kalamazoo, MI 49008, USA, e-mail: ping.zhang@wmich.edu
Abstract: For a nonempty set $S$ of vertices in a strong digraph $D$, the strong distance $d(S)$ is the minimum size of a strong subdigraph of $D$ containing the vertices of $S$. If $S$ contains $k$ vertices, then $d(S)$ is referred to as the $k$-strong distance of $S$. For an integer $k \geq2$ and a vertex $v$ of a strong digraph $D$, the $k$-strong eccentricity $\se_k(v)$ of $v$ is the maximum $k$-strong distance $d(S)$ among all sets $S$ of $k$ vertices in $D$ containing $v$. The minimum $k$-strong eccentricity among the vertices of $D$ is its $k$-strong radius $\srad_k D$ and the maximum $k$-strong eccentricity is its $k$-strong diameter $\sdiam_k D$. The $k$-strong center ($k$-strong periphery) of $D$ is the subdigraph of $D$ induced by those vertices of $k$-strong eccentricity $\srad_k(D)$ ($\sdiam_k (D)$). It is shown that, for each integer $k \geq2$, every oriented graph is the $k$-strong center of some strong oriented graph. A strong oriented graph $D$ is called strongly $k$-self-centered if $D$ is its own $k$-strong center. For every integer $r \geq6$, there exist infinitely many strongly 3-self-centered oriented graphs of 3-strong radius $r$. The problem of determining those oriented graphs that are $k$-strong peripheries of strong oriented graphs is studied.
Keywords: strong distance, strong eccentricity, strong center, strong periphery
Classification (MSC 2000): 05C12, 05C20
Full text available as PDF (smallest), as compressed PostScript (.ps.gz) or as raw PostScript (.ps).
Access to the full text of journal articles on this site is restricted to the subscribers of Myris Trade. To activate your access, please contact Myris Trade at myris@myris.cz.
