2283 search results - page 2 / 457 » Bounds of Graph Characteristics |
ENDM
2002
13 years 5 months ago
2002
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
ICANNGA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
CDC
2008
IEEE
13 years 12 months ago
2008
IEEE
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
SIROCCO
2004
13 years 6 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...