Sciweavers

    2 search results - page 1 / 1
    » A Prolific Construction of Strongly Regular Graphs with the ...
    Sort
    View
    COMBINATORICS
    2002
    52views more  COMBINATORICS 2002»
    A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property
    15 years 5 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
    15 years 5 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
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.