Sciweavers

    83
    Voted
    ARSCOM
    2008
    77views more  ARSCOM 2008»
    Generating Orthogonal Polynomials and their Derivatives using Vertex-Matching-Partitions of Graphs
    15 years 20 days ago
    Generating Orthogonal Polynomials and their Derivatives using Vertex-Matching-Partitions of Graphs
    Download  www.math.siu.edu
    John P. McSorley, Philip Feinsilver, René S...
    claim paper
    Read More »
    ARSCOM
    2008
    118views more  ARSCOM 2008»
    Proper Partitions of a Polygon and k-Catalan Numbers
    15 years 20 days ago
    Proper Partitions of a Polygon and k-Catalan Numbers
    Download  www.math.msu.edu
    Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1, 2, . . . , c. Motivated by conjectures of Propp, we are led to consider partitions of ...
    Bruce E. Sagan
    claim paper
    Read More »
    88
    Voted
    ARSCOM
    2008
    98views more  ARSCOM 2008»
    New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs
    15 years 20 days ago
    New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs
    Download  www.math.wvu.edu
    Yan Jin, Kewen Zhao, Hong-Jian Lai, Ju Zhou
    claim paper
    Read More »
    62
    Voted
    ARSCOM
    2008
    153views more  ARSCOM 2008»
    Counting polyominoes with minimum perimeter
    15 years 20 days ago
    Counting polyominoes with minimum perimeter
    Download  www.mathe2.uni-bayreuth.de
    Sascha Kurz
    claim paper
    Read More »
    ARSCOM
    2008
    103views more  ARSCOM 2008»
    Estimating the number of graphs containing very long induced paths
    15 years 20 days ago
    Estimating the number of graphs containing very long induced paths
    Download  www.math.ucsd.edu
    Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
    Steven Butler
    claim paper
    Read More »
    ARSCOM
    2008
    192views more  ARSCOM 2008»
    Bounds on the metric and partition dimensions of a graph
    15 years 20 days ago
    Bounds on the metric and partition dimensions of a graph
    Download  www.cs.uaf.edu
    Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
    Glenn G. Chappell, John G. Gimbel, Chris Hartman
    claim paper
    Read More »
    102
    Voted
    ARSCOM
    2008
    119views more  ARSCOM 2008»
    Greedy Defining Sets in Latin Squares
    15 years 20 days ago
    Greedy Defining Sets in Latin Squares
    Download  www.cs.umanitoba.ca
    A Greedy Defining Set is a set of entries in a Latin square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succee...
    Manouchehr Zaker
    claim paper
    Read More »
    ARSCOM
    2008
    110views more  ARSCOM 2008»
    Comment on "The Expectation Of Independent Domination Number Over Random Binary Trees"
    15 years 20 days ago
    Comment on "The Expectation Of Independent Domination Number Over Random Binary Trees"
    Download  www.math.siu.edu
    L. H. Clark, J. P. McSorley
    claim paper
    Read More »
    « first‹ previous12
    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.