Results 171 to 180 of about 2,078,525 (187)
Some of the next articles are maybe not open access.
2006
Publisher Summary This chapter provides an overview of the concept of distances in graph theory. A graph is a pair G = (V, E), where V is a set, called set of vertices of the graph G, and E is a set of unordered pairs of vertices, called edges of the graph G.
Michel Marie Deza, Elena Deza
openaire +2 more sources
Publisher Summary This chapter provides an overview of the concept of distances in graph theory. A graph is a pair G = (V, E), where V is a set, called set of vertices of the graph G, and E is a set of unordered pairs of vertices, called edges of the graph G.
Michel Marie Deza, Elena Deza
openaire +2 more sources
Mathematical Proceedings of the Cambridge Philosophical Society, 1947
We call a point set in a complex K a 0-cell if it contains just one point of K, and a 1-cell if it is an open arc. A set L of 0-cells and 1-cells of K is called a linear graph on K if(i) no two members of L intersect,(ii) the union of all the members of L is K,(iii) each end-point of a 1-cell of L is a 0-cell of Land (iv) the number of 0-cells and 1 ...
openaire +2 more sources
We call a point set in a complex K a 0-cell if it contains just one point of K, and a 1-cell if it is an open arc. A set L of 0-cells and 1-cells of K is called a linear graph on K if(i) no two members of L intersect,(ii) the union of all the members of L is K,(iii) each end-point of a 1-cell of L is a 0-cell of Land (iv) the number of 0-cells and 1 ...
openaire +2 more sources
2005
In this chapter we set out from a type of problem which, on the face of it, appears to be similar to the theme of Chapter 7: what kind of substructures are necessarily present in every large enough graph?
openaire +2 more sources
In this chapter we set out from a type of problem which, on the face of it, appears to be similar to the theme of Chapter 7: what kind of substructures are necessarily present in every large enough graph?
openaire +2 more sources
2005
In this chapter we study how global parameters of a graph, such as its edge density or chromatic number, can influence its local substructures. How many edges, for instance, do we have to give a graph on n vertices to be sure that, no matter how these edges are arranged, the graph will contain a K r subgraph for some given r?
openaire +2 more sources
In this chapter we study how global parameters of a graph, such as its edge density or chromatic number, can influence its local substructures. How many edges, for instance, do we have to give a graph on n vertices to be sure that, no matter how these edges are arranged, the graph will contain a K r subgraph for some given r?
openaire +2 more sources
1995
The objects that we study in the branch of mathematics known as graph theory are not graphs drawn with x and y axes. In this chapter, the word ‘graph’ refers to a structure consisting of points (called ‘vertices’), some of which may be joined to other vertices by lines (called ‘edges’) to form a network. Structures of this type abound in computing. The
openaire +2 more sources
The objects that we study in the branch of mathematics known as graph theory are not graphs drawn with x and y axes. In this chapter, the word ‘graph’ refers to a structure consisting of points (called ‘vertices’), some of which may be joined to other vertices by lines (called ‘edges’) to form a network. Structures of this type abound in computing. The
openaire +2 more sources
2010
This is a unique account of the role played by 58 figures and diagrams commonly used in economic theory. These cover a large part of mainstream economic analysis, both microeconomics and macroeconomics and also general equilibrium theory.
openaire +3 more sources
This is a unique account of the role played by 58 figures and diagrams commonly used in economic theory. These cover a large part of mainstream economic analysis, both microeconomics and macroeconomics and also general equilibrium theory.
openaire +3 more sources