Algorithmic complexity of weakly connected Roman domination in graphs. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/journals/dmaa/PadamuthamRH22>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Chakradhar_Padamutham>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Khandelwal_Himanshu>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/P._Venkata_Subba_Reddy_0001>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1142%2FS1793830921501251>
foaf:homepage	<https://doi.org/10.1142/S1793830921501251>
dc:identifier	DBLP journals/dmaa/PadamuthamRH22 (xsd:string)
dc:identifier	DOI doi.org%2F10.1142%2FS1793830921501251 (xsd:string)
dcterms:issued	2022 (xsd:gYear)
swrc:journal	<https://dblp.l3s.de/d2r/resource/journals/dmaa>
rdfs:label	Algorithmic complexity of weakly connected Roman domination in graphs. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Chakradhar_Padamutham>
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Khandelwal_Himanshu>
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/P._Venkata_Subba_Reddy_0001>
swrc:number	3 (xsd:string)
swrc:pages	2150125:1-2150125:14 (xsd:string)
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/journals/dmaa/PadamuthamRH22/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/journals/dmaa/PadamuthamRH22>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/journals/dmaa/dmaa14.html#PadamuthamRH22>
rdfs:seeAlso	<https://doi.org/10.1142/S1793830921501251>
dc:title	Algorithmic complexity of weakly connected Roman domination in graphs. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:Article
rdf:type	foaf:Document
swrc:volume	14 (xsd:string)