Extended Roman Domination Number Of Hexagonal Networks

@article{Ext1398411, author = {D.Antony Xavier,Chiranjilal Kujur,Elizabeth Thomas}, title = {Extended Roman Domination Number Of Hexagonal Networks}, journal={International Journal of Computing Algorithm}, volume={2}, issue={2}, issn = {2278-2397}, year = {2013}, 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>2013</publicationDate> <volume>2</volume> <issue>2</issue> <startPage>109</startPage> <endPage>111</endPage> <documentType>article</documentType> <title language='eng'>Extended Roman Domination Number Of Hexagonal Networks</title> <authors> <author> <name>D.Antony Xavier</name> </author> </authors> <abstract language='eng'>An extended Roman domination function on a graph G=V,E is a function satisfying the conditions that i every vertex u for which fu is either 0 or 1 is adjacent to at least one vertex v for which fv =3. ii if u and v are two adjacent vertices and if fu=0 then fv≠0, similarly if fu=1 then fv≠1. The weight of an extended Roman domination function is the value Σ The minimum weight of an extended Roman domination function on graph G is called the extended Roman domination number of G, denoted by .The Hexagonal networks are popular mesh-derived parallel architectures. In this paper we present an upper bound for the extended Roman domination number of hexagonal networks.</abstract> <fullTextUrl format='pdf'>http://www.hindex.org/2013/p984.pdf</fullTextUrl> <keywords language='eng'> <keyword>Extended Roman domination, Extended Roman domination number, Hexagonal network.</keyword> </keywords> </record>

{ "@context":"http://schema.org", "@type":"publication-article","identifier":"http://www.hindex.org/2013/article.php?page=984", "name":"Extended Roman Domination Number Of Hexagonal Networks", "author":[{"name":"D.Antony Xavier "}], "datePublished":"2013", "description":"An extended Roman domination function on a graph G=V,E is a function satisfying the conditions that i every vertex u for which fu is either 0 or 1 is adjacent to at least one vertex v for which fv =3. ii if u and v are two adjacent vertices and if fu=0 then fv≠0, similarly if fu=1 then fv≠1. The weight of an extended Roman domination function is the value Σ The minimum weight of an extended Roman domination function on graph G is called the extended Roman domination number of G, denoted by .The Hexagonal networks are popular mesh-derived parallel architectures. In this paper we present an upper bound for the extended Roman domination number of hexagonal networks.", "keywords":["Extended Roman domination, Extended Roman domination number, Hexagonal network."], "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>Chiranjilal Kujur</dc:contributor> <dc:contributor>Elizabeth Thomas</dc:contributor> <dc:contributor></dc:contributor> <dc:creator>D.Antony Xavier</dc:creator> <dc:date>2013</dc:date> <dc:description>An extended Roman domination function on a graph G=V,E is a function satisfying the conditions that i every vertex u for which fu is either 0 or 1 is adjacent to at least one vertex v for which fv =3. ii if u and v are two adjacent vertices and if fu=0 then fv≠0, similarly if fu=1 then fv≠1. The weight of an extended Roman domination function is the value Σ The minimum weight of an extended Roman domination function on graph G is called the extended Roman domination number of G, denoted by .The Hexagonal networks are popular mesh-derived parallel architectures. In this paper we present an upper bound for the extended Roman domination number of hexagonal networks.</dc:description> <dc:identifier>2013SCIA316F0984</dc:identifier> <dc:language>eng</dc:language> <dc:title>Extended Roman Domination Number Of Hexagonal Networks</dc:title> <dc:type>publication-article</dc:type> </oai_dc:dc>

{ "identifier": "2013SCIA316F0984", "abstract": "An extended Roman domination function on a graph G=V,E is a function satisfying the conditions that i every vertex u for which fu is either 0 or 1 is adjacent to at least one vertex v for which fv =3. ii if u and v are two adjacent vertices and if fu=0 then fv≠0, similarly if fu=1 then fv≠1. The weight of an extended Roman domination function is the value Σ The minimum weight of an extended Roman domination function on graph G is called the extended Roman domination number of G, denoted by .The Hexagonal networks are popular mesh-derived parallel architectures. In this paper we present an upper bound for the extended Roman domination number of hexagonal networks.", "author": [ { "family": "D.Antony Xavier,Chiranjilal Kujur,Elizabeth Thomas" } ], "id": "984", "issued": { "date-parts": [ [ 2013 ] ] }, "language": "eng", "publisher": "Scholarly Citation Index Analytics-SCIA", "title": " Extended Roman Domination Number Of Hexagonal Networks", "type": "publication-article", "version": "3" }