Scribd Logo
Upload

Welcome to Scribd!

  • Dual Graph Theory Project

    Uploaded by

    Mane omprakash
    64 views1 page
    A cut edge in a graph is an edge whose removal would disconnect the graph. For example, in Figure 26, removing edge e would disconnect the graph into two components. A block in a graph is a connected component that has no cut vertices, where removing a cut vertex would disconnect the graph. A tour of a graph is a closed walk that uses each edge at least once. An Euler tour uses each edge exactly once, and a graph with an Euler tour is called an Eulerian graph. For instance, the graph in Figure 28 has an Euler tour that uses each edge once.

    Original Description:

    Study of dual graph in mathematics and computer

    Original Title

    Dual graph theory project

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    A cut edge in a graph is an edge whose removal would disconnect the graph. For example, in Figure 26, removing edge e would disconnect the graph into two components. A block in a graph is a connected component that has no cut vertices, where removing a cut vertex would disconnect the graph. A tour of a graph is a closed walk that uses each edge at least once. An Euler tour uses each edge exactly once, and a graph with an Euler tour is called an Eulerian graph. For instance, the graph in Figure 28 has an Euler tour that uses each edge once.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    64 views1 page

    Dual Graph Theory Project

    Uploaded by

    Mane omprakash
    A cut edge in a graph is an edge whose removal would disconnect the graph. For example, in Figure 26, removing edge e would disconnect the graph into two components. A block in a graph is a connected component that has no cut vertices, where removing a cut vertex would disconnect the graph. A tour of a graph is a closed walk that uses each edge at least once. An Euler tour uses each edge exactly once, and a graph with an Euler tour is called an Eulerian graph. For instance, the graph in Figure 28 has an Euler tour that uses each edge once.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Example

    VI

    V1

    Figure26

    C U TEDGE

    An edge set E of a graphG is a on! edgeof G if W(G-e)>W(G) In particular,the

    removalof a cutedgefroma connected


    graphmaka thegraphdisconnected.

    Example

    Figumz7

    BLOCK

    A connectedgraph that has no cut verticesis called a Block

    TOUR

    A Tour of G is a closedwalk of G which includesevery edgeof G at leastonce.

    EULER T OUR

    An Euler Tour of G is a tour which includeseachedge of G exmly once.

    EULERIAN

    A graphG is called Eulerian or Euler if it hasan Euler Tour.


    e7
    Example e e.
    e. e,
    eto
    C.
    C. C,
    8,: cs
    c
    G
    Figure 8

    You might also like