Strong asymmetric digraphs with prescribed interior and annulus

Steven J. Winters

Czechoslovak Mathematical Journal (2001)

  • Volume: 51, Issue: 4, page 831-846
  • ISSN: 0011-4642

Abstract

top
The directed distance d ( u , v ) from u to v in a strong digraph D is the length of a shortest u - v path in D . The eccentricity e ( v ) of a vertex v in D is the directed distance from v to a vertex furthest from v in D . The center and periphery of a strong digraph are two well known subdigraphs induced by those vertices of minimum and maximum eccentricities, respectively. We introduce the interior and annulus of a digraph which are two induced subdigraphs involving the remaining vertices. Several results concerning the interior and annulus of a digraph are presented.

How to cite

top

Winters, Steven J.. "Strong asymmetric digraphs with prescribed interior and annulus." Czechoslovak Mathematical Journal 51.4 (2001): 831-846. <http://eudml.org/doc/30674>.

@article{Winters2001,
abstract = {The directed distance $d(u,v)$ from $u$ to $v$ in a strong digraph $D$ is the length of a shortest $u-v$ path in $D$. The eccentricity $e(v)$ of a vertex $v$ in $D$ is the directed distance from $v$ to a vertex furthest from $v$ in $D$. The center and periphery of a strong digraph are two well known subdigraphs induced by those vertices of minimum and maximum eccentricities, respectively. We introduce the interior and annulus of a digraph which are two induced subdigraphs involving the remaining vertices. Several results concerning the interior and annulus of a digraph are presented.},
author = {Winters, Steven J.},
journal = {Czechoslovak Mathematical Journal},
keywords = {interior of a digraph; annulus of a digraph; eccentricity},
language = {eng},
number = {4},
pages = {831-846},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {Strong asymmetric digraphs with prescribed interior and annulus},
url = {http://eudml.org/doc/30674},
volume = {51},
year = {2001},
}

TY - JOUR
AU - Winters, Steven J.
TI - Strong asymmetric digraphs with prescribed interior and annulus
JO - Czechoslovak Mathematical Journal
PY - 2001
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 51
IS - 4
SP - 831
EP - 846
AB - The directed distance $d(u,v)$ from $u$ to $v$ in a strong digraph $D$ is the length of a shortest $u-v$ path in $D$. The eccentricity $e(v)$ of a vertex $v$ in $D$ is the directed distance from $v$ to a vertex furthest from $v$ in $D$. The center and periphery of a strong digraph are two well known subdigraphs induced by those vertices of minimum and maximum eccentricities, respectively. We introduce the interior and annulus of a digraph which are two induced subdigraphs involving the remaining vertices. Several results concerning the interior and annulus of a digraph are presented.
LA - eng
KW - interior of a digraph; annulus of a digraph; eccentricity
UR - http://eudml.org/doc/30674
ER -

References

top
  1. The interior and the annulus of a graph, Congr. Numer. 102 (1994), 57–62. (1994) MR1382357

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.