Sciweavers

    2 search results - page 1 / 1
    » A Prolific Construction of Strongly Regular Graphs with the ...
    Sort
    View
    47
    Voted
    COMBINATORICS
    2002
    52views more  COMBINATORICS 2002»
    A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property
    14 years 9 months ago
    A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property
    Download  www.maths.tcd.ie
    Peter J. Cameron, Dudley Stark
    claim paper
    Read More »
    DM
    2008
    94views more  DM 2008»
    On low degree k-ordered graphs
    14 years 9 months ago
    On low degree k-ordered graphs
    Download  www-math.mit.edu
    A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
    Karola Mészáros
    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-2025, USA.