{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T14:01:00Z","timestamp":1648821660622},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2021,6]]},"abstract":"<jats:p> In this paper, the new concept [Formula: see text]-isodominism between two graphs is introduced, where [Formula: see text] is a positive integer. The [Formula: see text]-isodominism is a pair of the graph isomorphism which depends on the smallest [Formula: see text]-dominating sets. By this tool, a graph with one vertex, complete graphs, wheels and stars are in the same [Formula: see text]-isodominism class. Furthermore, some results about the [Formula: see text]-isodominism classes of paths, cycles and star polygon are presented. <\/jats:p>","DOI":"10.1142\/s1793830921500300","type":"journal-article","created":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T12:19:04Z","timestamp":1601381944000},"page":"2150030","source":"Crossref","is-referenced-by-count":0,"title":["The isodominism class of the graphs"],"prefix":"10.1142","volume":"13","author":[{"given":"Behnaz","family":"Tolue","sequence":"first","affiliation":[{"name":"Department of Pure Mathematics, Hakim Sabzevari University, Sabzevar, Iran"}]},{"given":"Amin","family":"Rafiei","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, Hakim Sabzevari University, Sabzevar, Iran"}]}],"member":"219","published-online":{"date-parts":[[2020,11,25]]},"reference":[{"key":"S1793830921500300BIB001","volume-title":"Abstract Algebra","author":"Beachy J. A.","year":"2006","edition":"3"},{"key":"S1793830921500300BIB002","volume-title":"Introduction to Graph Theory","author":"Chartrand G.","year":"2005"},{"key":"S1793830921500300BIB003","volume-title":"Fundamentals of Domination in Graphs","author":"Haynes T. W.","year":"1998"},{"key":"S1793830921500300BIB004","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"S1793830921500300BIB005","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/588\/11700"},{"key":"S1793830921500300BIB006","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2000","edition":"2"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830921500300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T07:28:01Z","timestamp":1619594881000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830921500300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,25]]},"references-count":6,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["10.1142\/S1793830921500300"],"URL":"https:\/\/doi.org\/10.1142\/s1793830921500300","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,11,25]]}}}