4,971 research outputs found

    The triangle-free graphs with rank 6

    Full text link
    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
    corecore