Graf terarah

Daripada Wikipedia, ensiklopedia bebas.
Pergi ke navigasi Pergi ke carian
Graf terarah yang mudah. Di sini anak panah berkepala dua mewakili dua tepi berbeza, satu bagi setiap arah.

Dalama matematik, dan lebih khusus dalam teori graf, graf terarah (atau digraf) ialah graf yang terdiri daripada set bucu disambung oleh tepi, di mana tepi mempunyai yang dikaitkan dengannya.

Lihat juga[sunting | sunting sumber]


Nota[sunting | sunting sumber]

Rujukan[sunting | sunting sumber]

  • Bang-Jensen, Jørgen; Gutin, Gregory (2000), Digraphs: Theory, Algorithms and Applications, Springer, ISBN 1-85233-268-9
    (the corrected 1st edition of 2007 is now freely available on the authors' site; the 2nd edition appeared in 2009 ISBN 1-84800-997-6).
  • Bondy, John Adrian; Murty, U. S. R. (1976), Graph Theory with Applications, North-Holland, ISBN 0-444-19451-7.
  • Diestel, Reinhard (2005), Graph Theory (ed. 3rd), Springer, ISBN 3-540-26182-6 (the electronic 3rd edition is freely available on author's site).
  • Harary, Frank; Norman, Robert Z.; Cartwright, Dorwin (1965), Structural Models: An Introduction to the Theory of Directed Graphs, New York: Wiley.
  • Number of directed graphs (or directed graphs) with n nodes from On-Line Encyclopedia of Integer Sequences