11 research outputs found

    Group weighing matrices

    Get PDF
    Ph.DDOCTOR OF PHILOSOPH

    Some Results On Spectrum And Energy Of Graphs With Loops

    Full text link
    Let GSG_S be a graph with loops obtained from a graph GG of order nn and loops at SV(G)S \subseteq V(G). In this paper, we establish a neccesary and sufficient condition on the bipartititeness of a connected graph GG and the spectrum Spec(GSG_S) and Spec(GV(G)\SG_{V(G)\backslash S}). We also prove that for every SV(G)S \subseteq V(G), E(GS)E(G)E(G_S) \geq E(G) when GG is bipartite. Moreover, we provide an identification of the spectrum of complete graphs KnK_n and complete bipartite graphs Km,nK_{m,n} with loops. We characterize any graphs with loops of order n whose eigenvalues are all positive or non-negative, and also any graphs with a few distinct eigenvalues. Finally, we provide some bounds related to GSG_S.Comment: 16 pages, published versio

    On equivalency of zero-divisor codes via classifying their idempotent generator

    No full text

    Full Identification of Idempotens in Binary Abelian Group Rings

    No full text

    Parikh Matries of Words.

    Get PDF
    The notion of Parikh matrix of a word over and ordered alphabets was introduced by Mateescu Et al

    Study of idempotents in cyclic group rings over F2

    No full text

    Full Identification of Idempotens in Binary Abelian Group Rings

    No full text
    Every code in the latest study of group ring codes is a submodule thathas a generator. Study reveals that each of these binary group ring codes can havemultiple generators that have diverse algebraic properties. However, idempotentgenerators get the most attention as codes with an idempotent generator are easierto determine its minimal distance. We have fully identify all idempotents in everybinary cyclic group ring algebraically using basis idempotents. However, the conceptof basis idempotent constrained the exibilities of extending our work into the studyof identication of idempotents in non-cyclic groups. In this paper, we extend theconcept of basis idempotent into idempotent that has a generator, called a generatedidempotent. We show that every idempotent in an abelian group ring is either agenerated idempotent or a nite sum of generated idempotents. Lastly, we show away to identify all idempotents in every binary abelian group ring algebraically by fully obtain the support of each generated idempotent

    Study of proper circulant weighing matrices with weight 9

    Get PDF
    10.1016/j.disc.2004.12.029Discrete Mathematics308132802-2809DSMH
    corecore