{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:19:27Z","timestamp":1772893167578,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T00:00:00Z","timestamp":1590710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T00:00:00Z","timestamp":1590710400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s00373-020-02174-9","type":"journal-article","created":{"date-parts":[[2020,5,29]],"date-time":"2020-05-29T20:03:39Z","timestamp":1590782619000},"page":"1219-1246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Which Graphs Occur as $$\\gamma $$-Graphs?"],"prefix":"10.1007","volume":"36","author":[{"given":"Matt","family":"DeVos","sequence":"first","affiliation":[]},{"given":"Adam","family":"Dyck","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5296-9700","authenticated-orcid":false,"given":"Jonathan","family":"Jedwab","sequence":"additional","affiliation":[]},{"given":"Samuel","family":"Simon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"key":"2174_CR1","first-page":"53","volume":"7","author":"S Aparna Lakshmanan","year":"2010","unstructured":"Aparna Lakshmanan, S., Vijayakumar, A.: The gamma graph of a graph. AKCE Int. J. Graphs Comb. 7, 53\u201359 (2010)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"2174_CR2","volume-title":"The Theory of Graphs and Its Applications","author":"C Berge","year":"1962","unstructured":"Berge, C.: The Theory of Graphs and Its Applications. Wiley, New York (1962)"},{"key":"2174_CR3","first-page":"25","volume":"29","author":"A Bie\u0144","year":"2015","unstructured":"Bie\u0144, A.: Gamma graphs of some special classes of trees. Ann. Math. Sil. 29, 25\u201334 (2015)","journal-title":"Ann. Math. Sil."},{"key":"2174_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74341-2","volume-title":"Distance-Regular Graphs","author":"A Brouwer","year":"1989","unstructured":"Brouwer, A., Cohen, A., Neumaier, A.: Distance-Regular Graphs. Springer, Berlin (1989)"},{"key":"2174_CR5","first-page":"23","volume":"8","author":"E Connelly","year":"2011","unstructured":"Connelly, E., Hutson, K., Hedetniemi, S.: A note on $$\\gamma $$-graphs. AKCE Int. J. Graphs Comb. 8, 23\u201331 (2011)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"2174_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(84)90033-5","volume":"50","author":"D Cvetkovi\u0107","year":"1984","unstructured":"Cvetkovi\u0107, D., Petri\u0107, M.: A table of connected graphs on six vertices. Discrete Math. 50, 37\u201349 (1984)","journal-title":"Discrete Math."},{"key":"2174_CR7","unstructured":"de\u00a0Ridder, H., et\u00a0al.: Information system on graph classes and their inclusions. http:\/\/www.graphclasses.org\/smallgraphs.html#nodes5"},{"key":"2174_CR8","unstructured":"Dyck, A.: The realisability of $$\\gamma $$-graphs. Master\u2019s thesis, Simon Fraser University (2017). http:\/\/summit.sfu.ca\/item\/17513"},{"key":"2174_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0021-9800(70)80083-7","volume":"8","author":"J Edmonds","year":"1970","unstructured":"Edmonds, J., Fulkerson, D.R.: Bottleneck extrema. J. Comb. Theory 8, 299\u2013306 (1970)","journal-title":"J. Comb. Theory"},{"key":"2174_CR10","unstructured":"Edwards, M.: Vertex-criticality and bicriticality for independent domination and total domination in graphs. Ph.D. thesis, University of Victoria (2015)"},{"key":"2174_CR11","doi-asserted-by":"publisher","first-page":"517","DOI":"10.7151\/dmgt.1562","volume":"31","author":"G Fricke","year":"2011","unstructured":"Fricke, G., Hedetniemi, S., Hedetniemi, S., Hutson, K.: $$\\gamma $$-graphs of graphs. Discuss. Math. Graph Theory 31, 517\u2013531 (2011)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2174_CR12","volume-title":"Handbook of Graph Theory, Discrete Mathematics and Its Applications","year":"2014","unstructured":"Gross, J., Yellen, J., Zhang, P. (eds.): Handbook of Graph Theory, Discrete Mathematics and Its Applications, 2nd edn. CRC Press, Boca Raton (2014)","edition":"2"},{"key":"2174_CR13","volume-title":"Domination in Graphs: Advanced Topics","author":"T Haynes","year":"1998","unstructured":"Haynes, T., Hedetniemi, S., Slater, P.: Domination in Graphs: Advanced Topics. Marcel Dekker Inc, New York (1998)"},{"key":"2174_CR14","volume-title":"Fundamentals of Domination in Graphs","author":"T Haynes","year":"1998","unstructured":"Haynes, T., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. Marcel Dekker Inc, New York (1998)"},{"key":"2174_CR15","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10878-016-0091-z","volume":"34","author":"M Henning","year":"2017","unstructured":"Henning, M., Lichiardopol, N.: Distance domination in graphs with given minimum and maximum degree. J. Comb. Optim. 34, 545\u2013553 (2017)","journal-title":"J. Comb. Optim."},{"key":"2174_CR16","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.ipl.2015.04.005","volume":"115","author":"I Honkala","year":"2015","unstructured":"Honkala, I., Hudry, O., Lobstein, A.: On the ensemble of optimal dominating and locating-dominating codes in a graph. Inf. Process. Lett. 115, 699\u2013702 (2015)","journal-title":"Inf. Process. Lett."},{"key":"2174_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s12095-015-0148-3","volume":"8","author":"I Honkala","year":"2016","unstructured":"Honkala, I., Hudry, O., Lobstein, A.: On the ensemble of optimal identifying codes in a twin-free graph. Cryptogr. Commun. 8, 139\u2013153 (2016)","journal-title":"Cryptogr. Commun."},{"key":"2174_CR18","volume-title":"Quantum Probability and Spectral Analysis of Graphs","author":"A Hora","year":"2007","unstructured":"Hora, A., Obata, N.: Quantum Probability and Spectral Analysis of Graphs. Springer, Berlin (2007)"},{"key":"2174_CR19","doi-asserted-by":"publisher","first-page":"154","DOI":"10.13001\/1081-3810.1256","volume":"17","author":"M Krebs","year":"2008","unstructured":"Krebs, M., Shaheen, A.: On the spectra of Johnson graphs. Electron. J. Linear Algebra 17, 154\u2013167 (2008)","journal-title":"Electron. J. Linear Algebra"},{"key":"2174_CR20","doi-asserted-by":"crossref","unstructured":"Kreutzer, S., Ordyniak, S.: Distance $$d$$-domination games. In: Graph-Theoretic Concepts in Computer Science, vol. 5911, pp. 308\u2013319. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-11409-0_27"},{"key":"2174_CR21","volume-title":"Introduction to Combinatorial Mathematics","author":"C Liu","year":"1968","unstructured":"Liu, C.: Introduction to Combinatorial Mathematics. McGraw-Hill Book Co., New York (1968)"},{"key":"2174_CR22","first-page":"369","volume":"7","author":"MA Malik","year":"2012","unstructured":"Malik, M.A., Ali, A.: The graph $$\\Delta $$\n$$_{2n-1}$$ is an induced subgraph of a Johnson graph. Int. J. Contemp. Math. Sci. 7, 369\u2013376 (2012)","journal-title":"Int. J. Contemp. Math. Sci."},{"key":"2174_CR23","first-page":"445","volume":"7","author":"MA Malik","year":"2012","unstructured":"Malik, M.A., Ali, A.: Some results on induced subgraphs of Johnson graphs. Int. Math. Forum J. Theory Appl. 7, 445\u2013454 (2012)","journal-title":"Int. Math. Forum J. Theory Appl."},{"key":"2174_CR24","unstructured":"Mynhardt, C., Teshima, L.: A note on some variations of the $$\\gamma $$-graph. arXiv:1707.02039 [math.CO]"},{"key":"2174_CR25","doi-asserted-by":"publisher","first-page":"25","DOI":"10.2140\/involve.2012.5.25","volume":"5","author":"R Naimi","year":"2012","unstructured":"Naimi, R., Shaw, J.: Induced subgraphs of Johnson graphs. Involve J. Math. 5, 25\u201337 (2012)","journal-title":"Involve J. Math."},{"key":"2174_CR26","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/038","volume-title":"Theory of Graphs","author":"O Ore","year":"1962","unstructured":"Ore, O.: Theory of Graphs. American Mathematical Society, Providence (1962)"},{"key":"2174_CR27","unstructured":"Sloane, N.: Number of connected graphs with $$n$$ nodes, sequence A001349. In: On-Line Encyclopedia of Integer Sequences. http:\/\/oeis.org\/A001349"},{"key":"2174_CR28","first-page":"231","volume":"69","author":"N Sridharan","year":"2009","unstructured":"Sridharan, N., Subramanian, K.: Trees and unicyclic graphs are $$\\gamma $$-graphs. J. Comb. Math. Comb. Comput. 69, 231\u2013236 (2009)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"2174_CR29","doi-asserted-by":"publisher","first-page":"1350012","DOI":"10.1142\/S1793830913500122","volume":"5","author":"N Sridharan","year":"2013","unstructured":"Sridharan, N., Amutha, S., Rao, S.: Induced subgraphs of gamma graphs. Discrete Math. Algorithms Appl. 5, 1350012 (2013)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"2174_CR30","first-page":"17","volume":"5","author":"K Subramanian","year":"2008","unstructured":"Subramanian, K., Sridharan, N.: $$\\gamma $$-graph of a graph. Bull. Kerala Math. Assoc. 5, 17\u201334 (2008)","journal-title":"Bull. Kerala Math. Assoc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02174-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02174-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02174-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T23:53:01Z","timestamp":1622245981000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02174-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5,29]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["2174"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02174-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,5,29]]},"assertion":[{"value":"10 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}