@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix owl: <http://www.w3.org/2002/07/owl#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .
@prefix dcterms: <http://purl.org/dc/terms/> .
@prefix bibo: <http://purl.org/ontology/bibo/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix prism: <http://prismstandard.org/namespaces/basic/2.1/> .
@prefix dctype: <http://purl.org/dc/dcmitype/> .

<https://doi.org/10.46243/jstj.2020.v5.i1.229>
    a bibo:AcademicArticle ;
    dcterms:type "JournalArticle" ;
    dcterms:identifier "10.46243/jstj.2020.v5.i1.229" ;
    bibo:doi "10.46243/jstj.2020.v5.i1.229" ;
    prism:doi "10.46243/jstj.2020.v5.i1.229" ;
    owl:sameAs <info:doi/10.46243/jstj.2020.v5.i1.229> ;
    owl:sameAs <doi:10.46243/jstj.2020.v5.i1.229> ;
    dcterms:title "Geodetic Dominating Set and Geodetic Domination Polynomials of Extended Grid Graphs"@en ;
    dcterms:abstract "Let G = (V,E) be a simple graph. A set S  V is a dominating set of G, if every vertex in V− S is adjacent to atleast one vertex S. Let Dg(Gn, i) be the family of geodetic dominating sets of the graph Gn with cardinality 'i'. Let dg(Gn, i) = | Dg(Gn, i)|. In this paper, we obtain a recursive for dg(Gn, i). Using the recursive formula, we construct the polynomial, g(Gn) = n + 1 2     , g(Gn − {2n}) = n + 1 2     which we call geodetic dominating polynomial of Gn and obtain some properties of this polynomial."@en ;
    dcterms:creator _:b1 ;
    dcterms:creator _:b2 ;
    dcterms:publisher _:b3 ;
    dcterms:issued "2020-01-02"^^xsd:date ;
    dcterms:date "2020-01-02"^^xsd:date ;
    prism:publicationDate "2020-01-02"^^xsd:date ;
    dcterms:language "en" ;
    dcterms:isPartOf <urn:issn:2456-5660> ;
    bibo:volume "05" ;
    prism:volume "05" ;
    bibo:issue "01" ;
    prism:number "01" ;
    bibo:pageStart "09" ;
    prism:startingPage "09" ;
    bibo:pageEnd "16" ;
    prism:endingPage "16" ;
    bibo:uri <https://www.jst.org.in/index.php/pub/article/view/229> ;
    dcterms:license <https://creativecommons.org/licenses/by/4.0/> ;
    dcterms:references <https://doi.org/10.1155/2009/542040> ;
    bibo:cites <https://doi.org/10.1155/2009/542040> ;
    dcterms:references <https://doi.org/10.4236/ojdm.2013.31013> ;
    bibo:cites <https://doi.org/10.4236/ojdm.2013.31013> ;
    dcterms:references <https://doi.org/10.9790/5728-0340414> ;
    bibo:cites <https://doi.org/10.9790/5728-0340414> ;
    dcterms:references <https://doi.org/10.14445/22315373/ijmtt-v11p507> ;
    bibo:cites <https://doi.org/10.14445/22315373/ijmtt-v11p507> ;
    rdfs:seeAlso <https://registry.smartscholars.in/record.php?doi=10.46243%2Fjstj.2020.v5.i1.229> .

_:b1
    a foaf:Person ;
    foaf:name "N.Jaspin Beaula" ;
    foaf:givenName "N.Jaspin" ;
    foaf:familyName "Beaula" .

_:b2
    a foaf:Person ;
    foaf:name "Dr.A Vijayan" ;
    foaf:givenName "Dr.A" ;
    foaf:familyName "Vijayan" .

_:b3
    a foaf:Organization ;
    foaf:name "Longman Publishers" .

<urn:issn:2456-5660>
    a bibo:Journal ;
    dcterms:title "Journal of Science & Technology" ;
    bibo:issn "2456-5660" ;
    prism:eIssn "2456-5660" .

