3268 search results - page 88 / 654 » The hub number of a graph |
197
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that -----(u)(v) is an arc in H whenever...
159
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
135
click to vote
SSS
2010
Springer
15 years 4 months ago
2010
Springer
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
179
click to vote
JSYML
2010
15 years 1 months ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
193
click to vote
FCT
2007
Springer
15 years 8 months ago
2007
Springer
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...