{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T00:17:18Z","timestamp":1703031438654},"reference-count":18,"publisher":"Informa UK Limited","issue":"3","license":[{"start":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T00:00:00Z","timestamp":1686268800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["AKCE International Journal of Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,9,2]]},"DOI":"10.1080\/09728600.2023.2218443","type":"journal-article","created":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T09:45:18Z","timestamp":1686303918000},"page":"244-246","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["Under which conditions is\n            <i>\u03bb\u2033(G)=\u03ba\u2033(L(G))<\/i>\n            ?"],"prefix":"10.1080","volume":"20","author":[{"given":"Farnaz","family":"Soliemany","sequence":"first","affiliation":[{"name":"Department of Mathematics, Urmia University, Urmia, Iran"}]},{"given":"Mohsen","family":"Ghasemi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Urmia University, Urmia, Iran"}]},{"given":"Rezvan","family":"Varmazyar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Khoy Branch, Islamic Azad University, Khoy, Iran"}]}],"member":"301","published-online":{"date-parts":[[2023,6,9]]},"reference":[{"key":"e_1_3_1_2_1","volume-title":"Line Graphs and Line Digraphs","author":"Bagga J. S.","year":"2021","unstructured":"Bagga, J. S., Beineke, L. W. (2021). Line Graphs and Line Digraphs. Cham: Springer"},{"key":"e_1_3_1_3_1","first-page":"89","volume-title":"The Theory and Application of Graphs","author":"Bauer D.","year":"1981","unstructured":"Bauer, D., Boesch, F., Suffel, C., Tindell, R. (1981). Connectivity extremal problems and the design of reliable probabilistic networks, In: Alavi, Y., Chartand, G., eds. The Theory and Application of Graphs. New York: Wiley, pp. 89\u201398."},{"key":"e_1_3_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1986.4335424"},{"key":"e_1_3_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.42131"},{"key":"e_1_3_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90025-7"},{"key":"e_1_3_1_7_1","article-title":"Super connectivity of lexicographic product graphs","author":"Kamyab kh.","unstructured":"Kamyab, kh., Ghasemi, M., Varmazyar, R. Super connectivity of lexicographic product graphs. Ars Combinatoria, arXiv:2009.04831[math.GR] (accepted).","journal-title":"Ars Combinatoria"},{"key":"e_1_3_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.20224"},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10255-005-0283-2"},{"key":"e_1_3_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.06.017"},{"key":"e_1_3_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2015.10.003"},{"issue":"1","key":"e_1_3_1_12_1","first-page":"1","article-title":"Super connectivity of a family of direct product graphs","volume":"7","author":"Soliemany F.","year":"2021","unstructured":"Soliemany, F., Ghasemi, M., Varmazyar, R. (2021). Super connectivity of a family of direct product graphs. Int. J. Comput. Math. Comput. Syst. Theory. 7(1): 1\u20135.","journal-title":"Int. J. Comput. Math. Comput. Syst. Theory"},{"key":"e_1_3_1_13_1","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2022085"},{"key":"e_1_3_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-014-1437-x"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7"},{"key":"e_1_3_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.02.001"},{"key":"e_1_3_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2011.08.021"},{"key":"e_1_3_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.04.020"},{"key":"e_1_3_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.09.015"}],"container-title":["AKCE International Journal of Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/09728600.2023.2218443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T17:41:31Z","timestamp":1703007691000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/09728600.2023.2218443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,9]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9,2]]}},"alternative-id":["10.1080\/09728600.2023.2218443"],"URL":"https:\/\/doi.org\/10.1080\/09728600.2023.2218443","relation":{},"ISSN":["0972-8600","2543-3474"],"issn-type":[{"value":"0972-8600","type":"print"},{"value":"2543-3474","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,9]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uakc20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=uakc20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-09-07","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-03","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}