IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4684-8971-2_2.html
   My bibliography  Save this book chapter

Theory of Finite and Infinite Graphs

In: Theory of Finite and Infinite Graphs

Author

Listed:
  • Dénes König

Abstract

Let {A, B, C…} be a set of “points.” If certain pairs of these points are connected by one or more “lines”, the resulting configuration is called a graph. Those points of {A, B, C…} which are connected with at least one point are called vertices of the graph. (Vertices which could be called “isolated” are therefore excluded.) The lines involved are called edges of the graph1. An edge which connects A and B, i.e. whose endpoints are A and B, and which goes to A (and B) we shall designate by AB. It is possible that several edges are designated as AB. If A is an endpoint of edge k, we shall also say that A and k are incident to each other. If the set of vertices and the set of edges of a graph are both finite, the graph is called finite, otherwise infinite. An infinite graph has infinitely many edges but possibly only finitely many vertices (e.g., two vertices can be connected by infinitely many edges.)

Suggested Citation

  • Dénes König, 1990. "Theory of Finite and Infinite Graphs," Springer Books, in: Theory of Finite and Infinite Graphs, pages 45-421, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4684-8971-2_2
    DOI: 10.1007/978-1-4684-8971-2_2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4684-8971-2_2. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.