{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:11:41Z","timestamp":1743142301534,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319788241"},{"type":"electronic","value":"9783319788258"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78825-8_22","type":"book-chapter","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T18:59:07Z","timestamp":1523905147000},"page":"264-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Power Domination Number of\u00a0de\u00a0Bruijn and Kautz Digraphs"],"prefix":"10.1007","author":[{"given":"Cyriac","family":"Grigorious","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8444-6848","authenticated-orcid":false,"given":"Thomas","family":"Kalinowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudeep","family":"Stephen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,17]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"1382","DOI":"10.1137\/06066672X","volume":"23","author":"A Aazami","year":"2009","unstructured":"Aazami, A., Stilp, K.: Approximation algorithms and hardness for domination with propagation. SIAM J. Discret. Math. 23, 1382\u20131399 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"AIM Minimum Rank \u2013 Special Graphs Work Group: Zero forcing sets and the minimum rank of graphs. Linear Algebra Appl. 428(7), 1628\u20131648 (2008)","DOI":"10.1016\/j.laa.2007.10.009"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.laa.2010.03.008","volume":"433","author":"F Barioli","year":"2010","unstructured":"Barioli, F., Barrett, W., Fallat, S.M., Hall, H.T., Hogben, L., Shader, B., van den Driessche, P., van der Holst, H.: Zero forcing parameters and minimum rank problems. Linear Algebra Appl. 433(2), 401\u2013411 (2010)","journal-title":"Linear Algebra Appl."},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"126","DOI":"10.13001\/1081-3810.1300","volume":"18","author":"F Barioli","year":"2009","unstructured":"Barioli, F., Fallat, S.M., Hall, H.T., Hershkowitz, D., Hogben, L., van der Holst, H., Shader, B.: On the minimum rank of not necessarily symmetric matrices: a preliminary study. Electron. J. Linear Algebra 18, 126\u2013145 (2009)","journal-title":"Electron. J. Linear Algebra"},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1002\/jgt.21637","volume":"72","author":"F Barioli","year":"2012","unstructured":"Barioli, F., Barrett, W., Fallat, S.M., Hall, H.T., Hogben, L., Shader, B., van den Driessche, P., van der Holst, H.: Parameters related to tree-width, zero forcing, and maximum nullity of a graph. J. Graph Theory 72(2), 146\u2013177 (2012)","journal-title":"J. Graph Theory"},{"issue":"7","key":"22_CR6","doi-asserted-by":"publisher","first-page":"1629","DOI":"10.1016\/j.laa.2008.04.038","volume":"429","author":"A Berman","year":"2008","unstructured":"Berman, A., Friedland, S., Hogben, L., Rothblum, U.G., Shader, B.: An upper bound for the minimum rank of a graph. Linear Algebra Appl. 429(7), 1629\u20131638 (2008)","journal-title":"Linear Algebra Appl."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1016\/j.dam.2012.03.007","volume":"160","author":"GJ Chang","year":"2012","unstructured":"Chang, G.J., Dorbec, P., Montassier, P., Raspaud, A.: Generalized power domination of graphs. Discret. Appl. Math. 160, 1691\u20131698 (2012)","journal-title":"Discret. Appl. Math."},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/060661879","volume":"22","author":"P Dorbec","year":"2008","unstructured":"Dorbec, P., Mollard, M., Klavzar, S., Spacapan, S.: Power domination in product graphs. SIAM J. Discret. Math. 22, 554\u2013567 (2008)","journal-title":"SIAM J. Discret. Math."},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1016\/j.disc.2015.03.011","volume":"338","author":"Y Dong","year":"2015","unstructured":"Dong, Y., Shan, E., Kang, L.: Constructing the minimum dominating sets of generalized de Bruijn digraphs. Discret. Math. 338, 1501\u20131508 (2015)","journal-title":"Discret. Math."},{"issue":"12","key":"22_CR10","doi-asserted-by":"publisher","first-page":"4352","DOI":"10.1016\/j.laa.2010.10.015","volume":"436","author":"CJ Edholm","year":"2012","unstructured":"Edholm, C.J., Hogben, L., Huynh, M., LaGrange, J., Row, D.D.: Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph. Linear Algebra Appl. 436(12), 4352\u20134372 (2012)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"22_CR11","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1137\/S0895480100375831","volume":"15","author":"TW Haynes","year":"2002","unstructured":"Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Henning, M.A.: Domination in graphs applied to electric power networks. SIAM J. Discret. Math. 15(4), 519\u2013529 (2002)","journal-title":"SIAM J. Discret. Math."},{"issue":"13\u201314","key":"22_CR12","doi-asserted-by":"publisher","first-page":"1994","DOI":"10.1016\/j.dam.2012.04.003","volume":"160","author":"L Hogben","year":"2012","unstructured":"Hogben, L., Huynh, M., Kingsley, N., Meyer, S., Walker, S., Young, M.: Propagation time for zero forcing on a graph. Discret. Appl. Math. 160(13\u201314), 1994\u20132005 (2012)","journal-title":"Discret. Appl. Math."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1016\/j.camwa.2005.10.015","volume":"51","author":"J Huang","year":"2006","unstructured":"Huang, J., Xu, J.M.: The bondage numbers of extended de Bruijn and Kautz digraphs. Comput. Math. Appl. 51, 1137\u20131147 (2006)","journal-title":"Comput. Math. Appl."},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TC.1983.1676323","volume":"32","author":"M Imase","year":"1983","unstructured":"Imase, M., Itoh, M.: A design for directed graphs with minimum diameter. IEEE Trans. Comput. 32, 782\u2013784 (1983)","journal-title":"IEEE Trans. Comput."},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"2961","DOI":"10.1142\/S1793830915500032","volume":"07","author":"J Kuo","year":"2015","unstructured":"Kuo, J., Wu, W.L.: Power domination in generalized undirected de Bruijn graphs and Kautz graphs. Discrete Math. Algorithm. Appl. 07, 2961\u20132973 (2015)","journal-title":"Discrete Math. Algorithm. Appl."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Lu, L., Wu, B., Tang, Z.: Proof of a conjecture on the zero forcing number of a graph. arXiv:1507.01364 (2015)","DOI":"10.1016\/j.dam.2016.05.009"},{"issue":"48","key":"22_CR17","doi-asserted-by":"publisher","first-page":"482002","DOI":"10.1088\/1751-8113\/41\/48\/482002","volume":"41","author":"S Severini","year":"2008","unstructured":"Severini, S.: Nondiscriminatory propagation on trees. J. Phys. A: Math. Theor. 41(48), 482002 (2008)","journal-title":"J. Phys. A: Math. Theor."},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.jda.2014.12.003","volume":"33","author":"S Stephen","year":"2015","unstructured":"Stephen, S., Rajan, B., Ryan, J., Grigorious, C., William, A.: Power domination in certain chemical structures. J. Discret. Algorithms 33, 10\u201318 (2015)","journal-title":"J. Discret. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78825-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:08:51Z","timestamp":1709809731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-78825-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319788241","9783319788258"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78825-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Newcastle","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/carma.newcastle.edu.au\/meetings\/iwoca\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}