✦ LIBER ✦

An upper bound for the minimum rank of a graph

✍ Scribed by Avi Berman; Shmuel Friedland; Leslie Hogben; Uriel G. Rothblum; Bryan Shader

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 137 KB
Volume: 429
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.04.038

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for the path number of a

An upper bound for the path number of a graph

✍ Alan Donald 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 529 KB

## Abstract The path number of a graph __G__, denoted __p(G)__, is the minimum number of edge‐disjoint paths covering the edges of __G.__ Lovász has proved that if __G__ has __u__ odd vertices and __g__ even vertices, then __p(G)__ ≤ 1/2 __u__ + __g__ ‐ 1 ≤ __n__ ‐ 1, where __n__ is the total numbe

An upper bound for the p-rank of a trans

An upper bound for the p-rank of a translation plane

✍ Jennifer D Key; Kirsten Mackenzie 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 217 KB

An upper bound for the harmonious chroma

An upper bound for the harmonious chromatic number of a graph

✍ Sin-Min Lee; John Mitchem 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB 👁 2 views

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment of colors to the vertices of a graph such that each vertex has exactly one color has been studied for well o

An upper bound for the k-domination numb

An upper bound for the k-domination number of a graph

✍ E. J. Cockayne; B. Gamble; B. Shepherd 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 2 views

The kdomination number of a graph G, y k ( G ) , is the least cardinality of a set U of verticies such that any other vertex is adjacent to at least k vertices of U. We prove that if each vertex has degree at least k. then YAG) 5 kp/(k + 1).

An upper bound for the radius of a 3-con

An upper bound for the radius of a 3-connected graph

✍ Jochen Harant 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 286 KB

For a 3-connected graph with radius r containing n vertices, in [1] r < n/4 + O(log n) was proved and r < n/4 + const was conjectured. Here we prove r < n/4 + 8. Let G be a simple 3-connected finite graph on n vertices with vertex set V(G) and edge set E(G). For X, YE V(G) we denote by d(X, Y) the

Techniques for determining the minimum r

Techniques for determining the minimum rank of a small graph

✍ Laura DeLoss; Jason Grout; Leslie Hogben; Tracy McKay; Jason Smith; Geoff Tims 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 131 KB