On minimum locally n -(arc)-strong digraphs

Zhibo Chen

Czechoslovak Mathematical Journal (1996)

  • Volume: 46, Issue: 2, page 317-323
  • ISSN: 0011-4642

How to cite

top

Chen, Zhibo. "On minimum locally $n$-(arc)-strong digraphs." Czechoslovak Mathematical Journal 46.2 (1996): 317-323. <http://eudml.org/doc/30310>.

@article{Chen1996,
author = {Chen, Zhibo},
journal = {Czechoslovak Mathematical Journal},
keywords = {-strong digraph; -arc-strong digraph; neighborhood; oriented graph; tournament},
language = {eng},
number = {2},
pages = {317-323},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On minimum locally $n$-(arc)-strong digraphs},
url = {http://eudml.org/doc/30310},
volume = {46},
year = {1996},
}

TY - JOUR
AU - Chen, Zhibo
TI - On minimum locally $n$-(arc)-strong digraphs
JO - Czechoslovak Mathematical Journal
PY - 1996
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 46
IS - 2
SP - 317
EP - 323
LA - eng
KW - -strong digraph; -arc-strong digraph; neighborhood; oriented graph; tournament
UR - http://eudml.org/doc/30310
ER -

References

top
  1. 10.1109/TCT.1970.1083102, IEEE Trans. Circuit Theory CT–17 (1970), 249–250. (1970) MR0266814DOI10.1109/TCT.1970.1083102
  2. 10.1007/BF01788663, Graphs and Combinatorics 5 (1989), 107–123. (1989) MR0998267DOI10.1007/BF01788663
  3. Graphs and Digraphs, Second edition, Wadsworth, 1986. (1986) MR0834583
  4. Locally connected graphs, Časopis Pěst. Mat. 99 (1974), 158–163. (1974) MR0398872
  5. On locally n -(arc) -strong digraphs, (to appear). (to appear) MR1310403
  6. Local connectedness of digraphs, Graph Theory, Combinatorics, and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, Vol. 1, Y. Alavi and A. Schwenk (eds.), John Willey & Sons, New York, 1995, pp. 195–200. (1995) MR1405809
  7. 10.1016/S0195-6698(84)80034-7, Europ. J. Combinatorics 5 (1984), 309–312. (1984) Zbl0561.05028MR0782052DOI10.1016/S0195-6698(84)80034-7
  8. Connectivity and edge-connectivity in finite graphs, Surveys in Combinatorics: Proc. Seventh British Combinatorial Conference, Cambridge 1979, London, Math. Soc. Lec. Note Ser. 38, 1979, pp. 66–95. (1979) Zbl0404.05040MR0561307
  9. 10.1002/jgt.3190050211, J. Graph Theory 5 (1981), 205–207. (1981) MR0615009DOI10.1002/jgt.3190050211
  10. On locally quasiconnected graphs and their upper embeddability, Czechoslovak Math. J. 35 (1985), no. 110, 162–166. (1985) MR0779344
  11. N 2 -locally connected graphs and their upper embeddability, Czechoslovak Math. J. 41 (1991), no. 116, 731–735. (1991) MR1134962
  12. On graphs with isomorphic, non-isomorphic and connected N 2 -neighborhoods, Časopis Pěst. Mat. 112 (1987), 66–79. (1987) 
  13. Local properties of graphs, Časopis Pěst. Mat. 106 (1981), 290–298. (Czech) (1981) MR0629727
  14. Sufficient conditions for locally connected graphs, Časopis Pěst. Mat. 99 (1974), 400–404. (1974) Zbl0294.05123MR0543786

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.