Results 1 to 3 of 3

Math Help - [SOLVED] Graph operations ??

  1. #1
    Newbie
    Joined
    Jun 2009
    Posts
    2

    Question [SOLVED] Graph operations ??

    can someone help me with this plz? there are 2 questions.

    1.
    A graph is defined as a pair of 2 sets. therefore operations on graphs are defined in terms of sets and set operations. Define the following operations on graph.
    1. union
    2. intersection
    3. compliment
    4. decomposition

    2.
    in set theory we have empty set what is the analogues concept in empty set of graph theory. Find different concept for empty graph and determine the situations where each definition is suitable.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor

    Joined
    Apr 2005
    Posts
    16,413
    Thanks
    1852
    Quote Originally Posted by gihanbw View Post
    can someone help me with this plz? there are 2 questions.
    These look to me like basic definitions that you should be able to look up in your textbook.

    1.
    A graph is defined as a pair of 2 sets. therefore operations on graphs are defined in terms of sets and set operations. Define the following operations on graph.
    The "2 sets" being the set of vertices and the set of edges between vertices.

    1. union
    The graph whose vertices are precisely the vertices in the set of vertices of either of the two given graphs and whose edges are the edges in the set of edges of either of the two given graphs.

    2. intersection
    The graph whose vertices are the vertices that are in sets of vertices of both given graphs and whose edges are in the set of edges of both given graphs.

    3. compliment
    To be able to define a compliment of a set, you must have a "universal" set: a set of all things that can be in a set of the type considered. In order to be able to define the compliment of a graph, you would have to have a "universal" graph: a graph that contains all possible vertices and edges. In that case the "compliment" of a graph is just the graph whose set of vertices contains all those vertices in the universal graph that are not in the given graph and whose set of edges contains all the edges between those vertices in the universal graph.

    [/quote4. decomposition[/quote]
    I don't recognize this. What is the definition of a graph dividing it into two distinct graphs?

    2.
    in set theory we have empty set what is the analogues concept in empty set of graph theory. Find different concept for empty graph and determine the situations where each definition is suitable.
    Why not the "empty" graph that has no vertices and no edges.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Jul 2009
    Posts
    8
    without vertices there is no graph so say a empty graph we need atleast vertices
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. [SOLVED] Operations with ideals in a ring.
    Posted in the Advanced Algebra Forum
    Replies: 7
    Last Post: May 19th 2010, 10:16 AM
  2. [SOLVED] Binary Operations
    Posted in the Discrete Math Forum
    Replies: 6
    Last Post: May 10th 2010, 04:17 PM
  3. [SOLVED] Matrix Operations
    Posted in the Advanced Algebra Forum
    Replies: 2
    Last Post: February 14th 2010, 08:30 AM
  4. [SOLVED] bit operations...need some help
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: April 18th 2009, 04:05 PM
  5. [SOLVED] Precalculus: operations on functions
    Posted in the Pre-Calculus Forum
    Replies: 2
    Last Post: February 22nd 2009, 03:59 PM

Search Tags


/mathhelpforum @mathhelpforum