Theory of Finite and Infinite Graphs

Dénes König

A chapter in Theory of Finite and Infinite Graphs, 1990, pp 45-421 from Springer

Abstract: 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.)

Keywords: Bipartite Graph; Star Form; Regular Graph; Hamiltonian Cycle; Finite Graph (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4684-8971-2_2

Ordering information: This item can be ordered from
http://www.springer.com/9781468489712

DOI: 10.1007/978-1-4684-8971-2_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().