On rank of a matrix associated with graph
โ Scribed by Vladimir Dobrynin
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 255 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1571-0653
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Wiseman, J.A., On the intersection rank of a graph, Discrete Mathematics 104 293-305.
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
Given a row-finite directed graph E, a universal C\*-algebra C\*(E) generated by a family of partial isometries and projections subject to the relations determined by E is associated to the graph E. The Cuntz-Krieger algebras are those graph C\*-algebras associated to some finite graphs. We prove th