{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:34:32Z","timestamp":1649122472069},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:p> Let [Formula: see text] and [Formula: see text] be two labeled graphs of order [Formula: see text]. For any permutation [Formula: see text] the [Formula: see text]-permutation graph of labeled graphs [Formula: see text] and [Formula: see text] is the union of [Formula: see text] and [Formula: see text] together with the edges joining the vertex [Formula: see text] to the vertex [Formula: see text]. This operation on graphs is useful to produce a large class of networks with approximately the same properties as one of the original networks or even smaller. In this work we consider some properties of the permutation graph [Formula: see text], for labeled graph [Formula: see text] and [Formula: see text] of the same order. We provide bounds for the parameters radius, diameter, total distance, connectivity, edge-connectivity, chromatic number, and edge-chromatic number. <\/jats:p>","DOI":"10.1142\/s1793830915500512","type":"journal-article","created":{"date-parts":[[2015,9,15]],"date-time":"2015-09-15T01:49:14Z","timestamp":1442281754000},"page":"1550051","source":"Crossref","is-referenced-by-count":4,"title":["(G1,G2)-permutation graphs"],"prefix":"10.1142","volume":"07","author":[{"given":"Behrooz","family":"Bagheri Gh.","sequence":"first","affiliation":[{"name":"Department of Mathematical Sciences, Sharif University of Technology, P. O. Box 11155\u20139415,\u00a0Tehran, Iran"}]}],"member":"219","published-online":{"date-parts":[[2016,1,4]]},"reference":[{"key":"S1793830915500512BIB001","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0060108"},{"key":"S1793830915500512BIB003","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199905)33:3<161::AID-NET1>3.0.CO;2-3"},{"key":"S1793830915500512BIB005","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"Harary F.","year":"1969"},{"key":"S1793830915500512BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0060115"},{"key":"S1793830915500512BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00131-V"},{"key":"S1793830915500512BIB010","first-page":"7","volume":"65","author":"Piazza B. L.","year":"1988","journal-title":"Congr. Numer."},{"key":"S1793830915500512BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(91)90047-Z"},{"key":"S1793830915500512BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90068-6"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830915500512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:34:06Z","timestamp":1565109246000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830915500512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":8,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,1,4]]},"published-print":{"date-parts":[[2015,12]]}},"alternative-id":["10.1142\/S1793830915500512"],"URL":"https:\/\/doi.org\/10.1142\/s1793830915500512","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12]]}}}