3268 search results - page 15 / 654 » The hub number of a graph |
COMBINATORICS
2004
13 years 9 months ago
2004
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
IEEEARES
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—Attack Graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through se...
CPC
2004
13 years 9 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
DM
2010
13 years 9 months ago
2010
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm...