Domination Number On Balanced Signed Graphs

@article{Dom1486733, author = {R.Malathi,A.Alwin}, title = {Domination Number On Balanced Signed Graphs}, journal={International Journal of Computing Algorithm}, volume={3}, issue={3}, issn = {2278-2397}, year = {2014}, publisher = {Scholarly Citation Index Analytics-SCIA}

<?xml version='1.0' encoding='UTF-8'?> <record> <language>eng</language> <journalTitle>International Journal of Computing Algorithm</journalTitle> <eissn>2278-2397 </eissn> <publicationDate>2014</publicationDate> <volume>3</volume> <issue>3</issue> <startPage>324</startPage> <endPage>327</endPage> <documentType>article</documentType> <title language='eng'>Domination Number On Balanced Signed Graphs</title> <authors> <author> <name>R.Malathi</name> </author> </authors> <abstract language='eng'>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 DF defined as the largest dG such that G is a signed graph based on F. If F is the completebipartite graph with t vertices in each part, then Df≤ ½ t² - for some positive constant c.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2014/p867.pdf</fullTextUrl> <keywords language='eng'> <keyword>Balanced Signed Graphs,completebipartite graph</keyword> </keywords> </record>

{ "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2014/article.php?page=867", "name":"Domination Number On Balanced Signed Graphs", "author":[{"name":"R.Malathi "}], "datePublished":"2014", "description":"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 DF defined as the largest dG such that G is a signed graph based on F. If F is the completebipartite graph with t vertices in each part, then Df≤ ½ t² - for some positive constant c.", "keywords":["Balanced Signed Graphs,completebipartite graph"], "schemaVersion":"https://schema.org/version/3.3", "includedInDataCatalog":{ "@type":"DataCatalog", "name":"Scholarly Citation Index Analytics-SCIA", "url":"http://hindex.org"}, "publisher":{"@type":"Organization", "name":"Scientific Communications Research Academy" } }

<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"> <dc:contributor>A.Alwin</dc:contributor> <dc:contributor></dc:contributor> <dc:contributor></dc:contributor> <dc:creator>R.Malathi</dc:creator> <dc:date>2014</dc:date> <dc:description>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 DF defined as the largest dG such that G is a signed graph based on F. If F is the completebipartite graph with t vertices in each part, then Df≤ ½ t² - for some positive constant c.</dc:description> <dc:identifier>2014SCIA316F0867</dc:identifier> <dc:language>eng</dc:language> <dc:title>Domination Number On Balanced Signed Graphs</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

{ "identifier": "2014SCIA316F0867", "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 DF defined as the largest dG such that G is a signed graph based on F. If F is the completebipartite graph with t vertices in each part, then Df≤ ½ t² - for some positive constant c.", "author": [ { "family": "R.Malathi,A.Alwin" } ], "id": "867", "issued": { "date-parts": [ [ 2014 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " Domination Number On Balanced Signed Graphs", "type": "publication-article", "version": "3" }