Sciweavers

    46 search results - page 2 / 10
    » Total Domination and Matching Numbers in Claw-Free Graphs
    Sort
    View
    JGT
    2010
    87views more  JGT 2010»
    Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
    13 years 6 months ago
    Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
    Download  www.math.uiuc.edu
    Suil O, Douglas B. West
    claim paper
    Read More »
    COMBINATORICA
    2007
    81views more  COMBINATORICA 2007»
    Total domination of graphs and small transversals of hypergraphs
    13 years 7 months ago
    Total domination of graphs and small transversals of hypergraphs
    Download  www.lirmm.fr
    The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
    Stéphan Thomassé, Anders Yeo
    claim paper
    Read More »
    DM
    2006
    104views more  DM 2006»
    Construction of trees and graphs with equal domination parameters
    13 years 7 months ago
    Construction of trees and graphs with equal domination parameters
    Download  www.cs.clemson.edu
    We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
    Michael Dorfling, Wayne Goddard, Michael A. Hennin...
    claim paper
    Read More »
    DAM
    1999
    119views more  DAM 1999»
    On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
    13 years 7 months ago
    On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs
    Download  www.dcs.gla.ac.uk
    The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to cov...
    David Manlove
    claim paper
    Read More »
    FCS
    2009
    200views Computer Science» more  FCS 2009»
    Domination and Independence on the Rectangular Torus by Rooks and Bishops
    13 years 5 months ago
    Domination and Independence on the Rectangular Torus by Rooks and Bishops
    Download  science.kennesaw.edu
    A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...
    Joe DeMaio, William Faust
    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.