• Title of article

    On the spanning fan-connectivity of graphs Original Research Article

  • Author/Authors

    Cheng-Kuan Lin، نويسنده , , Jimmy J.M. Tan، نويسنده , , D. Frank Hsu، نويسنده , , Lih-Hsing Hsu، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2009
  • Pages
    7
  • From page
    1342
  • To page
    1348
  • Abstract
    Let image be a graph. The connectivity of image, image, is the maximum integer image such that there exists a image-container between any two different vertices. A image-container of image between image and image, image, is a set of image-internally-disjoint paths between image and image. A spanning container is a container that spans image. A graph image is image-connected if there exists a spanning image-container between any two different vertices. The spanning connectivity of image, image, is the maximum integer image such that image is image-connected for image if image is image-connected.
  • Keywords
    Spanning pipeline-connectivity , Graph container , Hamiltonian connected , Hamiltonian , Dirac Theorem , Menger Theorem , Ore Theorem , Connectivity , Spanning fan-connectivity , Spanning connectivity
  • Journal title
    Discrete Applied Mathematics
  • Serial Year
    2009
  • Journal title
    Discrete Applied Mathematics
  • Record number

    887064