Results 201 to 210 of about 6,789,089 (246)
Some of the next articles are maybe not open access.
Quality & Quantity: International Journal of Methodology, 2021
Wensen Huang
semanticscholar +1 more source
Wensen Huang
semanticscholar +1 more source
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
Combinatorics and Graph Theory
1993The commands that deal with combinatorics and graph theory reside in the combinat and networks packages, respectively.
openaire +2 more sources
The Mathematical Gazette, 1963
Suppose there are n towns every pair of which are connected by a single one-way road (roads meet only at towns). Is it possible to choose the direction of the traffic on all the roads so that if any two towns are named there is always a third from which the two named can be reached directly by road?
openaire +2 more sources
Suppose there are n towns every pair of which are connected by a single one-way road (roads meet only at towns). Is it possible to choose the direction of the traffic on all the roads so that if any two towns are named there is always a third from which the two named can be reached directly by road?
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
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
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