{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T08:33:12Z","timestamp":1768552392190,"version":"3.49.0"},"reference-count":13,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:p> Graph theory is a useful tool to study the properties of algebraic structures. Here we are going to employ this tool to study nominal sets. To do so, we employ the freshness relation to construct certain graphs so-called fresh-graph, due to the key role of freshness relation in obtaining these graphs. We then investigate the properties of these graphs to determine some properties of nominal sets. <\/jats:p>","DOI":"10.1142\/s1793830922501610","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T12:10:01Z","timestamp":1663330201000},"source":"Crossref","is-referenced-by-count":0,"title":["The fresh-graph of a nominal set"],"prefix":"10.1142","volume":"15","author":[{"given":"H.","family":"Pasbani","sequence":"first","affiliation":[{"name":"Faculty of Mathematics, Statistics and Computer Science, Semnan University, Semnan, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9697-4544","authenticated-orcid":false,"given":"M.","family":"Haddadi","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics, Statistics and Computer Science, Semnan University, Semnan, Iran"}]}],"member":"219","published-online":{"date-parts":[[2022,10,20]]},"reference":[{"key":"S1793830922501610BIB001","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-42282-4","volume-title":"Finitely Supported Mathematics: An Introduction","author":"Alexandru A.","year":"2016"},{"key":"S1793830922501610BIB002","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.entcs.2016.09.029","volume":"325","author":"Amorim A. A.","year":"2016","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"S1793830922501610BIB003","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0021-8693(88)90202-5","volume":"116","author":"Beck I.","year":"1988","journal-title":"J. Algebra"},{"issue":"3","key":"S1793830922501610BIB004","first-page":"1","volume":"10","author":"Boja\u0144czyk M.","year":"2014","journal-title":"Logical Meth. Comput. Sci."},{"key":"S1793830922501610BIB005","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"Bollob\u00e1s B.","year":"1998"},{"key":"S1793830922501610BIB006","doi-asserted-by":"crossref","first-page":"174","DOI":"10.2307\/2369306","volume":"1","author":"Cayley A.","year":"1878","journal-title":"Amer. J. Math."},{"key":"S1793830922501610BIB007","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/j.ic.2006.12.002","volume":"205","author":"Fernandez M.","year":"2007","journal-title":"Inf. Comput."},{"key":"S1793830922501610BIB008","first-page":"253","author":"Fraenkel J. A.","year":"1922","journal-title":"Sitz. Preus. Akad. Wiss., Phys.-Math. Kl."},{"key":"S1793830922501610BIB009","first-page":"158","volume-title":"Int. Conf. Logic for Programming, Artificial Intelligence, and Reasoning","author":"Gabbay M.","year":"2008"},{"key":"S1793830922501610BIB010","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"Gabbay M. J.","year":"2002","journal-title":"Form. Asp. Comput."},{"key":"S1793830922501610BIB011","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139084673","volume-title":"Nominal Sets: Names and Symmetry in Computer Science","author":"Pitts A. M.","year":"2013"},{"key":"S1793830922501610BIB012","first-page":"202","volume-title":"LIPIcs\u2013Leibniz Int. Proc. Inform.","author":"Pitts A. M.","year":"2015"},{"key":"S1793830922501610BIB013","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001","edition":"2"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501610","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T09:09:40Z","timestamp":1689930580000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501610"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,20]]},"references-count":13,"journal-issue":{"issue":"07","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["10.1142\/S1793830922501610"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501610","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,20]]},"article-number":"2250161"}}