research

The triangle-free graphs with rank 6

Abstract

The rank of a graph G is defined to be the rank of its adjacency matrix A(G). In this paper we characterize all connected triangle-free graphs with rank 6

    Similar works

    Full text

    thumbnail-image

    Available Versions