Let q = 2 be, for some β N, and let n = q 2 +q +1. By exhibiting a complete coloring of the edges of K n , we show that the pseudoachromatic number (G n ) of the complete line graph G n = L(K n )-or the pseudoachromatic index of K n , if you will-is at least q 3 +q. This bound improves the implicit
β¦ LIBER β¦
The Pseudoachromatic Number of a Graph
β Scribed by V. Yegnanarayanan
- Publisher
- Springer
- Year
- 2000
- Weight
- 65 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0129-2021
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the pseudoachromatic index of the com
β
M. Gabriela Araujo-Pardo; Juan JosΓ© Montellano-Ballesteros;; Ricardo Strausz
π
Article
π
2010
π
John Wiley and Sons
π
English
β 162 KB
The discipline number of a graph
β
V. ChvΓ‘tal; W. Cook
π
Article
π
1990
π
Elsevier Science
π
English
β 481 KB
The hull number of a graph
β
Martin G Everett; Stephen B Seidman
π
Article
π
1985
π
Elsevier Science
π
English
β 379 KB
A set of points S of a graph is convex if any geodesic joining two points of S lies entirely within S. The convex hull of a set T of points is the smallest convex set that contains T. The hull number (h) of a graph is the cardinality of the smallest set of points whose convex hull is the entire grap
The bondage number of a graph
β
John Frederick Fink; Michael S. Jacobson; Lael F. Kinch; John Roberts
π
Article
π
1990
π
Elsevier Science
π
English
β 654 KB
The geodetic number of a graph
β
Frank Harary; Emmanuel Loukakis; Constantine Tsouros
π
Article
π
1993
π
Elsevier Science
π
English
β 406 KB
The basis number of a graph
β
Edward F Schmeichel
π
Article
π
1981
π
Elsevier Science
π
English
β 353 KB