Sciweavers

    48 search results - page 4 / 10
    » ejc 2006
    Sort
    View
    EJC
    2006
    93views Information Technology» more  EJC 2006»
    Hamilton cycles in random lifts of graphs
    13 years 9 months ago
    Hamilton cycles in random lifts of graphs
    Download  www.math.cmu.edu
    An n-lift of a graph K, is a graph with vertex set V (K)
    K. Burgin, Prasad Chebolu, Colin Cooper, Alan M. F...
    claim paper
    Read More »
    EJC
    2006
    66views Information Technology» more  EJC 2006»
    Toward the classification of Moufang loops of order 64
    13 years 9 months ago
    Toward the classification of Moufang loops of order 64
    Download  www.du.edu
    We show how to obtain all nonassociative Moufang loops of order less than 64 and 4262 nonassociative Moufang loops of order 64 in a unified way. We conjecture that there are no oth...
    Petr Vojtechovský
    claim paper
    Read More »
    EJC
    2006
    99views Information Technology» more  EJC 2006»
    Product representations of polynomials
    13 years 9 months ago
    Product representations of polynomials
    Download  www.math.ucsd.edu
    For a fixed polyomial f Z[X], let k(N) denote the maximum size of a set A {1, 2, . . . , N} such that no product of k distinct elements of A is in the value set of f. In this pap...
    Jacques Verstraëte
    claim paper
    Read More »
    EJC
    2006
    124views Information Technology» more  EJC 2006»
    On the canonical metric representation, average distance, and partial Hamming graphs
    13 years 9 months ago
    On the canonical metric representation, average distance, and partial Hamming graphs
    Download  www.fmf.uni-lj.si
    Average distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometr...
    Sandi Klavzar
    claim paper
    Read More »
    EJC
    2006
    77views Information Technology» more  EJC 2006»
    Invariant subspaces, duality, and covers of the Petersen graph
    13 years 9 months ago
    Invariant subspaces, duality, and covers of the Petersen graph
    Download  www.fmf.uni-lj.si
    A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
    Aleksander Malnic, Primoz Potocnik
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.