Abstract
Outside the classical theory of hypergraphs, there is a beginning of theory which is not yet stabilized, it is the theory of directed hypergraphs. This chapter investigates the notion of directed hypergraph (dirhypergraph). We try to clarify its vocabulary.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
H.E. Robbins, A theorem on graphs with an application to a problem of traffic control. Am. Math. Mon. 46, 281–283 (1939)
J. Bang-Jensen, G. Gutin, Digraphs: Theory, Algorithms and Applications. Springer Monographs in Mathematics, 2nd edn. (Springer-Verlag, London, 2006)
M. Garey, D.S. Johnson, Computers and Intractability—A Guide to NP-Completeness (W. H. Freeman, New York, 1979)
N. Biggs, Algebraic Graph Theory (Cambridge Press University, Cambridge, 1994)
C.D. Godsil, G. Royle, Algebraic Graph Theory (Springer-Verlag, New York, 2001)
J. Lauri, R. Scapellato, Topics in Graph Automorphisms and Reconstruction. Student Book, vol. 54 (Cambridge University Press, London Mathematical Society, 2004)
B. Mohar, The laplacian spectrum of graphs, in Graph Theory, Combinatorics, and Applications, vol. 2, ed. by O.R. Oellermann, A.J. Schwenk Y. Alavi, G. Chartrand, (Wiley, New York 1991), pp. 871–898
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Bretto, A. (2013). Dirhypergraphs: Basic Concepts. In: Hypergraph Theory. Mathematical Engineering. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-00080-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-00080-0_6
Published:
Publisher Name: Springer, Heidelberg
Print ISBN: 978-3-319-00079-4
Online ISBN: 978-3-319-00080-0
eBook Packages: EngineeringEngineering (R0)