{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T02:14:29Z","timestamp":1714356869156},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,1,28]],"date-time":"2014-01-28T00:00:00Z","timestamp":1390867200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s11227-014-1085-1","type":"journal-article","created":{"date-parts":[[2014,1,27]],"date-time":"2014-01-27T06:24:17Z","timestamp":1390803857000},"page":"1241-1264","source":"Crossref","is-referenced-by-count":3,"title":["Deriving length two path centered surface area for the arrangement graph: a generating function approach"],"prefix":"10.1007","volume":"68","author":[{"given":"Eddie","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhizhang","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,28]]},"reference":[{"key":"1085_CR1","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","volume":"38","author":"SB Akers","year":"1989","unstructured":"Akers SB, Krishnamurthy B (1989) A group theoretic model for symmetric interconnection networks. IEEE Trans Comput 38:555\u2013566","journal-title":"IEEE Trans Comput"},{"key":"1085_CR2","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1109\/12.628393","volume":"46","author":"M Bae","year":"1997","unstructured":"Bae M, Bose B (1997) Resource placement in torus-based networks. IEEE Trans Comput 46:1083\u20131092","journal-title":"IEEE Trans Comput"},{"key":"1085_CR3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0012-365X(95)00095-E","volume":"159","author":"M Benoumhani","year":"1996","unstructured":"Benoumhani M (1996) On Whitney numbers of Dowling lattices. Discret Math 159:13\u201333","journal-title":"Discret Math"},{"key":"1085_CR4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1142\/S0129626409000031","volume":"19","author":"E Cheng","year":"2009","unstructured":"Cheng E, Qiu K, Shen Z (2009) A short note on the surface area of star graphs. Parallel Process Lett 19:19\u201322","journal-title":"Parallel Process Lett"},{"key":"1085_CR5","doi-asserted-by":"crossref","first-page":"2903","DOI":"10.1080\/00207160903134255","volume":"87","author":"E Cheng","year":"2010","unstructured":"Cheng E, Qiu K, Shen Z (2010) On deriving explicit formulas of the surface areas for the arrangement graphs and some of the related graphs. Int J Comput Math 87:2903\u20132914","journal-title":"Int J Comput Math"},{"key":"1085_CR6","unstructured":"Cheng E, Qiu K, Shen Z (2012) Length two path centered surface area for bipartite graphs, preprint. J Comb Math Comb Comput"},{"key":"1085_CR7","doi-asserted-by":"crossref","unstructured":"Cheng E, Qiu K, Shen Z (2013) Length two path centered surface area for the arrangement graph. Int J Comput Math. doi: 10.1080\/00207160.2013.829215","DOI":"10.1080\/00207160.2013.829215"},{"key":"1085_CR8","doi-asserted-by":"crossref","first-page":"674","DOI":"10.1016\/j.ipl.2012.06.008","volume":"112","author":"E Cheng","year":"2012","unstructured":"Cheng E, Lipt\u00e1k L, Qiu K, Shen Z (2012) On deriving conditional diagnosability of interconnection networks. Inf Process Lett 112:674\u2013677","journal-title":"Inf Process Lett"},{"key":"1085_CR9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(92)90030-Y","volume":"42","author":"K Day","year":"1992","unstructured":"Day K, Tripathi A (1992) Arrangement graphs: a class of generalized star graphs. Inf Process Lett 42:235\u2013241","journal-title":"Inf Process Lett"},{"key":"1085_CR10","unstructured":"Fertin G, Raspaud A (2001) $$k$$ k -neighbourhood broadcasting. In: Proceedings of the 8th International Colloquium on Structural Information and Communication, Complexity (SIROCCO\u201901), pp 133\u2013146"},{"key":"1085_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet P, Sedgewick R (2009) Analytic combinatorics. Cambridge University Press, UK"},{"key":"1085_CR12","volume-title":"Concrete mathematics","author":"R Graham","year":"1989","unstructured":"Graham R, Knuth D, Patashnik O (1989) Concrete mathematics. Addison-Wesley, Reading"},{"key":"1085_CR13","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1016\/j.disc.2008.08.007","volume":"309","author":"N Imani","year":"2009","unstructured":"Imani N, Sarbazi-Azad H, Akl SG (2009) Some combinatorial properties of the star graphs: the surface area and volume. Discret Math 309:560\u2013569","journal-title":"Discret Math"},{"key":"1085_CR14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/net.3230230414","volume":"23","author":"JS Jwo","year":"1993","unstructured":"Jwo JS, Lakshmivarahan S, Dhall SK (1993) A new class of interconnection networks based on the alternating graph. Networks 23:315\u2013326","journal-title":"Networks"},{"key":"1085_CR15","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/TC.2005.19","volume":"54","author":"P-L Lai","year":"2005","unstructured":"Lai P-L, Tan JJM, Chang C-P, Hsu L-H (2005) Conditional diagnosability measures for large multiprocessor systems. IEEE Trans Comput 54:165\u2013175","journal-title":"IEEE Trans Comput"},{"key":"1085_CR16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1142\/S0219265908002175","volume":"9","author":"CK Lin","year":"2008","unstructured":"Lin CK, Tan JM, Hsu LH, Cheng E, Lipt\u00e1k L (2008) Conditional diagnosability of Cayley graphs generated by transposition trees under the comparison diagnosis model. J Interconnect Netw 9:83\u201397","journal-title":"J Interconnect Netw"},{"key":"1085_CR17","unstructured":"Maeng J, Malek M (1981) A comparison connection assignment for self-diagnosis of multiprocessor systems. In: Proceedings of the 11th International Symposium on Fault-Tolerant, Computing, pp 173\u2013175"},{"key":"1085_CR18","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0195-6698(13)80127-8","volume":"11","author":"F Portier","year":"1990","unstructured":"Portier F, Vaughan T (1990) Whitney numbers of the second kind for the star poset. Eur J Comb 11:277\u2013288","journal-title":"Eur J Comb"},{"key":"1085_CR19","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/S0166-218X(03)00294-4","volume":"138","author":"M Sampels","year":"2004","unstructured":"Sampels M (2004) Vertex-symmetric generalized Moore graphs. Discret Appl Math 138:195\u2013202","journal-title":"Discret Appl Math"},{"key":"1085_CR20","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1142\/S0219265904001039","volume":"5","author":"H Sarbazi-Azad","year":"2004","unstructured":"Sarbazi-Azad H, Ould-Khaoua M, Mackenzie L, Akl SG (2004) On the combinatorial properties of $$k$$ k - ary $$n$$ n - cubes. J Interconnect Netw 5:79\u201391","journal-title":"J Interconnect Netw"},{"key":"1085_CR21","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.tcs.2012.05.015","volume":"452","author":"I Stewart","year":"2012","unstructured":"Stewart I (2012) A general technique to establish the asymptotic conditional diagnosability of interconnection networks. Theor Comput Sci 452:132\u2013137","journal-title":"Theor Comput Sci"},{"key":"1085_CR22","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1016\/j.aml.2005.09.004","volume":"19","author":"L Wang","year":"2006","unstructured":"Wang L, Subrammanian S, Latifi S, Srimani PK (2006) Distance distribution of nodes in star graphs. Appl Math Lett 19:780\u2013784","journal-title":"Appl Math Lett"},{"key":"1085_CR23","volume-title":"Generatingfunctionology","author":"H Wilf","year":"1994","unstructured":"Wilf H (1994) Generatingfunctionology, 2nd edn. Academic Press, San Diego","edition":"2"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1085-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1085-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1085-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:40:31Z","timestamp":1559385631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1085-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,28]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["1085"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1085-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,28]]}}}