{"id":"https://openalex.org/W2586454374","doi":"https://doi.org/10.1142/s1793830917500240","title":"New and improved results on the signed (total) k-domination number of graphs","display_name":"New and improved results on the signed (total) k-domination number of graphs","publication_year":2017,"publication_date":"2017-02-10","ids":{"openalex":"https://openalex.org/W2586454374","doi":"https://doi.org/10.1142/s1793830917500240","mag":"2586454374"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830917500240","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830917500240","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059518359","display_name":"Doost Ali Mojdeh","orcid":"https://orcid.org/0000-0001-9373-3390"},"institutions":[{"id":"https://openalex.org/I4871159","display_name":"University of Mazandaran","ror":"https://ror.org/05fp9g671","country_code":"IR","type":"education","lineage":["https://openalex.org/I4871159"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"D. A. Mojdeh","raw_affiliation_strings":["Department of Mathematics, University of Mazandaran, Babolsar, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Mazandaran, Babolsar, Iran","institution_ids":["https://openalex.org/I4871159"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089171322","display_name":"Babak Samadi","orcid":"https://orcid.org/0000-0003-0045-1883"},"institutions":[{"id":"https://openalex.org/I4871159","display_name":"University of Mazandaran","ror":"https://ror.org/05fp9g671","country_code":"IR","type":"education","lineage":["https://openalex.org/I4871159"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Babak Samadi","raw_affiliation_strings":["Department of Mathematics, University of Mazandaran, Babolsar, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Mazandaran, Babolsar, Iran","institution_ids":["https://openalex.org/I4871159"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4871159"],"apc_list":null,"apc_paid":null,"fwci":0.4784,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6449281,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"09","issue":"02","first_page":"1750024","last_page":"1750024"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9775999784469604,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9621999859809875,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6988290548324585},{"id":"https://openalex.org/keywords/domination-analysis","display_name":"Domination analysis","score":0.6827526092529297},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6234460473060608},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5964363813400269},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5831131935119629},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4279195964336395}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6988290548324585},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.6827526092529297},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6234460473060608},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5964363813400269},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5831131935119629},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4279195964336395},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830917500240","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830917500240","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W788200807","https://openalex.org/W1539183000","https://openalex.org/W1543322965","https://openalex.org/W2006409610","https://openalex.org/W2030378184","https://openalex.org/W2088616916","https://openalex.org/W2394918215","https://openalex.org/W2773462233","https://openalex.org/W3141776272"],"related_works":["https://openalex.org/W4291318508","https://openalex.org/W2794522194","https://openalex.org/W1976691234","https://openalex.org/W2963176699","https://openalex.org/W4205905997","https://openalex.org/W2986400025","https://openalex.org/W2349109195","https://openalex.org/W2069797780","https://openalex.org/W4297965885","https://openalex.org/W2078360221"],"abstract_inverted_index":{"In":[0,43],"this":[1,44],"paper,":[2],"we":[3,21,46,56],"study":[4],"the":[5,60,80],"signed":[6,81],"[Formula:":[7,83,87,92,96,100],"see":[8,84,88,93,97,101],"text]-domination":[9,85],"and":[10,26,49],"its":[11],"total":[12,82],"version":[13],"in":[14,36,53,69],"graphs.":[15],"By":[16],"a":[17,34,91],"simple":[18],"uniform":[19],"approach":[20],"give":[22],"some":[23,51],"new":[24],"upper":[25],"lower":[27],"bounds":[28],"on":[29],"these":[30],"two":[31],"parameters":[32],"of":[33,38,59,63,90],"graph":[35,41,70,95],"terms":[37],"several":[39],"different":[40],"parameters.":[42],"way,":[45],"can":[47],"improve":[48],"generalize":[50],"results":[52],"literature.":[54],"Moreover,":[55],"make":[57],"use":[58],"well-known":[61],"theorem":[62],"Tur\u00e1n":[64],"[On":[65],"an":[66],"extremal":[67],"problem":[68],"theory,":[71],"Math.":[72],"Fiz.":[73],"Lapok":[74],"48":[75],"(1941)":[76],"436\u2013452]":[77],"to":[78],"bound":[79],"number,":[86],"text],":[89],"text]-free":[94],"text]":[98],"for":[99],"text].":[102]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}