DNA Computing Models.Springer. 2008. Domination in Permutation Graphs

@article{DNA1458766, author = {J.Chithra,S.P.Subbiah,V.Swaminathan}, title = {DNA Computing Models.Springer. 2008. Domination in Permutation Graphs}, journal={International Journal of Computing Algorithm}, volume={3}, issue={1}, 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>1</issue> <startPage>61</startPage> <endPage>64</endPage> <documentType>article</documentType> <title language='eng'>DNA Computing Models.Springer. 2008. Domination in Permutation Graphs</title> <authors> <author> <name>J.Chithra</name> </author> </authors> <abstract language='eng'>If i, j belongs to a permutation on n symbols {1, 2, …, p} and i is less than j then there is an edge between i and j in the permutation graph if i appears after j. (i. e) inverse of i is greater than the inverse of j. So the line of i crosses the line of j in the permutation. So there is a one to one correspondence between crossing of lines in the permutation and the edges of the corresponding permutation graph. In this paper we found the conditions for a permutation to realize paths and cycles and also derived the domination number of permutation graph through the permutation. AMS Subject Classification (2010): 05C35, 05C69, 20B30.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2014/p587.pdf</fullTextUrl> <keywords language='eng'> <keyword>Permutation Graphs, Domination Number of a Permutation</keyword> </keywords> </record>

{ "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2014/article.php?page=587", "name":"DNA Computing Models.Springer. 2008. Domination in Permutation Graphs", "author":[{"name":"J.Chithra "}], "datePublished":"2014", "description":"If i, j belongs to a permutation on n symbols {1, 2, …, p} and i is less than j then there is an edge between i and j in the permutation graph if i appears after j. (i. e) inverse of i is greater than the inverse of j. So the line of i crosses the line of j in the permutation. So there is a one to one correspondence between crossing of lines in the permutation and the edges of the corresponding permutation graph. In this paper we found the conditions for a permutation to realize paths and cycles and also derived the domination number of permutation graph through the permutation. AMS Subject Classification (2010): 05C35, 05C69, 20B30.", "keywords":["Permutation Graphs, Domination Number of a Permutation"], "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>S.P.Subbiah</dc:contributor> <dc:contributor>V.Swaminathan</dc:contributor> <dc:contributor></dc:contributor> <dc:creator>J.Chithra</dc:creator> <dc:date>2014</dc:date> <dc:description>If i, j belongs to a permutation on n symbols {1, 2, …, p} and i is less than j then there is an edge between i and j in the permutation graph if i appears after j. (i. e) inverse of i is greater than the inverse of j. So the line of i crosses the line of j in the permutation. So there is a one to one correspondence between crossing of lines in the permutation and the edges of the corresponding permutation graph. In this paper we found the conditions for a permutation to realize paths and cycles and also derived the domination number of permutation graph through the permutation. AMS Subject Classification (2010): 05C35, 05C69, 20B30.</dc:description> <dc:identifier>2014SCIA316F0587</dc:identifier> <dc:language>eng</dc:language> <dc:title>DNA Computing Models.Springer. 2008. Domination in Permutation Graphs</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

{ "identifier": "2014SCIA316F0587", "abstract": "If i, j belongs to a permutation on n symbols {1, 2, …, p} and i is less than j then there is an edge between i and j in the permutation graph if i appears after j. (i. e) inverse of i is greater than the inverse of j. So the line of i crosses the line of j in the permutation. So there is a one to one correspondence between crossing of lines in the permutation and the edges of the corresponding permutation graph. In this paper we found the conditions for a permutation to realize paths and cycles and also derived the domination number of permutation graph through the permutation. AMS Subject Classification (2010): 05C35, 05C69, 20B30.", "author": [ { "family": "J.Chithra,S.P.Subbiah,V.Swaminathan" } ], "id": "587", "issued": { "date-parts": [ [ 2014 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " DNA Computing Models.Springer. 2008. Domination in Permutation Graphs", "type": "publication-article", "version": "3" }