✦ LIBER ✦

Vertex-Compressed Subalgebras of a Graph von

✍ Scribed by Ilwoo Cho

Publisher: Springer Netherlands
Year: 2008
Tongue: English
Weight: 741 KB
Volume: 108
Category: Article
ISSN: 0167-8019
DOI: 10.1007/s10440-008-9314-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On vertex ranking of a starlike graph

✍ Sun-yuan Hsieh 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 76 KB

A vertex coloring c : V → {1, 2, . . . , t} of a graph G = (V , E) is a vertex t-ranking if for any two vertices of the same color every path between them contains a vertex of larger color. The vertex ranking number χ r (G) is the smallest value of t such that G has a vertex t-ranking. A χ r (G)-ran

The rank of a graph after vertex additio

The rank of a graph after vertex addition

✍ Jean H. Bevis; Kevin K. Blount; George J. Davis; Gayla S. Domke; Valerie A. Mill 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 471 KB

Let r(G) denote the rank of the adjacency matrix of a graph G. When a vertex and its incident edges are deleted from G, the rank of the resultant graph cannot exceed r(G) and can decrease by at most 2. The problem of determining the exact effect of adding a single vertex to a graph is more difficult

On the linear vertex-arboricity of a pla

On the linear vertex-arboricity of a planar graph

✍ K. S. Poh 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 2 views

## Abstract We prove in this note that the linear vertex‐arboricity of any planar graph is at most three, which confirms a conjecture due to Broere and Mynhardt, and others.

On a theorem about vertex colorings of g

On a theorem about vertex colorings of graphs

✍ Claudio Bernardi 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 121 KB

Lawrence [2, Theorem 3] and Borodin and Kostochka [1, Lemma 2' 1 both give the same theorem about vertex colorings of graphs (Corollary 1 below). But Lawrence's proof, although powerful, is a little long, and Borodin and Kostoehka state the result without a proof.

A characterization of locally finite ver

A characterization of locally finite vertex-transitive graphs

✍ Carsten Thomassen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 200 KB

A kind of conditional vertex connectivit

A kind of conditional vertex connectivity of star graphs

✍ Min Wan; Zhao Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 380 KB

In this work, we prove that κ 2 (S n ) = 6(n -3) for n ≥ 4, where S n is the n-dimensional star graph.