Scribd Logo
Upload

Welcome to Scribd!

  • Domination Number On Balanced Signed Graphs

    Uploaded by

    International Journal of Computing Algorithm
    4 views1 page
    A signed graph based on F is an ordinary graph F with each edge marked as positive or negative. Such a graph is called balanced if each of its cycles includes an even number of negative edges. We find the domination set on the vertices, on bipartite graphs and show that graphs has domination Number on signed graphs, such that a signed graph G may be converted into a balanced graph by changing the signs of d edges. We investigate the number D (F) defined as the largest d (G) such that G is a signed graph based on F. If F is the complete bipartite graph with t vertices in each part, then D(f)≤ ½ t² -ct? ?? for some positive constant c.

    Original Title

    Domination Number on Balanced Signed Graphs

    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 signed graph based on F is an ordinary graph F with each edge marked as positive or negative. Such a graph is called balanced if each of its cycles includes an even number of negative edges. We find the domination set on the vertices, on bipartite graphs and show that graphs has domination Number on signed graphs, such that a signed graph G may be converted into a balanced graph by changing the signs of d edges. We investigate the number D (F) defined as the largest d (G) such that G is a signed graph based on F. If F is the complete bipartite graph with t vertices in each part, then D(f)≤ ½ t² -ct? ?? for some positive constant c.

    Copyright:

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

    Domination Number On Balanced Signed Graphs

    Uploaded by

    International Journal of Computing Algorithm
    A signed graph based on F is an ordinary graph F with each edge marked as positive or negative. Such a graph is called balanced if each of its cycles includes an even number of negative edges. We find the domination set on the vertices, on bipartite graphs and show that graphs has domination Number on signed graphs, such that a signed graph G may be converted into a balanced graph by changing the signs of d edges. We investigate the number D (F) defined as the largest d (G) such that G is a signed graph based on F. If F is the complete bipartite graph with t vertices in each part, then D(f)≤ ½ t² -ct? ?? for some positive constant c.

    Copyright:

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

    International Journal of Computing Algorithm, Vol 3(3), June 2014

    ISSN(Print):2278-2397

    Domination Number on Balanced Signed Graphs


    R.Malathi1, A.Alwin2
    1

    Asst.Prof, 2 M.Phil Scholar


    Dept of Mathematics, Scsvmv Univeristy, Enathur, Kanchipuram, Tamil Nadu
    E-mail: malathihema@yahoo.co.in, alwin.best111@gmail.com

    Abstract
    A signed graph based on F is an ordinary graph F with each edge marked as positive or
    negative. Such a graph is called balanced if each of its cycles includes an even number of
    negative edges. We find the domination set on the vertices, on bipartite graphs and show
    that graphs has domination Number on signed graphs, such that a signed graph G may be
    converted into a balanced graph by changing the signs of d edges. We investigate the number
    D (F) defined as the largest d (G) such that G is a signed graph based on F. If F is the
    complete bipartite graph with t vertices in each part, then D(f) t -ct
    constant c.

    Website: www.ijcoa.com

    for some positive

    You might also like