4 research outputs found

    Nonderogatory Directed Webgraph

    Get PDF
    By assigning a certain direction to the webgraphs, which are defined as the Cartesian product of cycles and paths, we prove that they are nonderogatory

    Subject Index Volumes 1–200

    Get PDF

    The complete product of annihilatingly unique digraphs

    Get PDF
    Let G be a digraph with n vertices and let A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if f(A(G))=0. G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. Difans and diwheels are two classes of annihilatingly unique digraphs. In this paper, it is shown that the complete product of difan and diwheel is annihilatingly unique
    corecore