{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:39:37Z","timestamp":1649173177583},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,3,28]],"date-time":"2016-03-28T00:00:00Z","timestamp":1459123200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s11786-016-0260-6","type":"journal-article","created":{"date-parts":[[2016,3,28]],"date-time":"2016-03-28T05:40:30Z","timestamp":1459143630000},"page":"239-248","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["T-Coloring of Certain Networks"],"prefix":"10.1007","volume":"10","author":[{"given":"P.","family":"Sivagami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indra","family":"Rajasingh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,28]]},"reference":[{"issue":"1","key":"260_CR1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.22436\/jmcs.002.01.05","volume":"2","author":"R Bharati","year":"2011","unstructured":"Bharati, R., Rajasingh, I., Venugopal, P.: Metric dimension of uniform and quasi-uniform theta graphs. J. Comput. Math. Sci. 2(1), 37\u201346 (2011)","journal-title":"J. Comput. Math. Sci."},{"key":"260_CR2","first-page":"191","volume":"35","author":"MB Cozzens","year":"1982","unstructured":"Cozzens, M.B., Roberts, F.S.: $$T$$ T -colorings of graphs and the channel assignment problem. Congres. Numer. 35, 191\u2013208 (1982)","journal-title":"Congres. Numer."},{"key":"260_CR3","first-page":"115","volume":"41","author":"MB Cozzens","year":"1984","unstructured":"Cozzens, M.B., Wang, D.I.: The general channel assignment problem. Congres. Numer. 41, 115\u2013129 (1984)","journal-title":"Congres. Numer."},{"key":"260_CR4","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0097-3165(94)90096-5","volume":"68","author":"JR Griggs","year":"1994","unstructured":"Griggs, J.R., Liu, D.D.F.: The channel assignment problem for mutually adjacent sites. J. Comb. Theory Ser. A 68, 169\u2013183 (1994)","journal-title":"J. Comb. Theory Ser. A"},{"key":"260_CR5","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68, 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"key":"260_CR6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01164636","volume":"12","author":"H Hosoya","year":"1993","unstructured":"Hosoya, H., Harary, F.: On the matching properties of three fence graphs. J. Math. Chem. 12, 211\u2013218 (1993)","journal-title":"J. Math. Chem."},{"key":"260_CR7","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s003730050063","volume":"15","author":"SJ Hu","year":"1999","unstructured":"Hu, S.J., Juan, S.T., Chang, G.J.: $$T$$ T -colorings and $$T$$ T -edge spans of Graphs. Graphs Comb. 15, 295\u2013301 (1999)","journal-title":"Graphs Comb."},{"key":"260_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(94)00344-I","volume":"154","author":"K Jansen","year":"1996","unstructured":"Jansen, K.: A Rainbow about $$T$$ T -coloring for Complete Graphs. Discret. Math. 154, 129\u2013139 (1996)","journal-title":"Discret. Math."},{"issue":"4","key":"260_CR9","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.11650\/twjm\/1500405511","volume":"13","author":"JST Juan","year":"2009","unstructured":"Juan, J.S.T., Sun, I.-F., Wu, P.-X.: $$T$$ T -coloring on folded hypercubes. Taiwan. J. Math. 13(4), 1331\u20131341 (2009)","journal-title":"Taiwan. J. Math."},{"key":"260_CR10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0012-365X(92)90603-D","volume":"101","author":"DDF Liu","year":"1992","unstructured":"Liu, D.D.F.: $$T$$ T -colorings of graphs. Discret. Math. 101, 203\u2013212 (1992)","journal-title":"Discret. Math."},{"key":"260_CR11","first-page":"198","volume":"161","author":"DDF Liu","year":"1996","unstructured":"Liu, D.D.F.: $$T$$ T -graphs and the channel assignment problem. Discret. Math. 161, 198\u2013205 (1996)","journal-title":"Discret. Math."},{"key":"260_CR12","unstructured":"Liu, D.D.F.: Graph Homomorphisms and the Channel Assignment Problem. Ph.D. Thesis, Department of Mathematics, University of Carolina, Columbia, SC (1991)"},{"key":"260_CR13","unstructured":"Raychaudhuri, A.: Intersection Assignments, $$T$$ T -coloring, and Powers of Graphs. Ph.D. Thesis, Rutgers University, New Brunswick, NJ (1985)"},{"key":"260_CR14","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1137\/S0895480189171746","volume":"7","author":"A Raychaudhuri","year":"1994","unstructured":"Raychaudhuri, A.: Further results on $$T$$ T -colorings and frequency assignment problems. SIAM J. Discret. Math. 7, 605\u2013613 (1994)","journal-title":"SIAM J. Discret. Math."},{"key":"260_CR15","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"FS Roberts","year":"1991","unstructured":"Roberts, F.S.: $$T$$ T -colorings of graphs: recent results and open problems. Discret. Math. 93, 229\u201324 (1991)","journal-title":"Discret. Math."},{"key":"260_CR16","unstructured":"Tesman, B.A.: $$T$$ T -colorings, list $$T$$ T -colorings, and set $$T$$ T -colorings of Graphs. Ph.D. Thesis, Department of Mathematics, Rutgers University, New Brunswich, NJ (1989)"},{"key":"260_CR17","first-page":"15","volume":"74","author":"BA Tesman","year":"1990","unstructured":"Tesman, B.A.: Application of forbidden difference graphs to $$T$$ T -colorings. Congres. Numer. 74, 15\u201324 (1990)","journal-title":"Congres. Numer."},{"key":"260_CR18","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0166-218X(93)90015-G","volume":"45","author":"BA Tesman","year":"1993","unstructured":"Tesman, B.A.: List $$T$$ T -colorings of graphs. Discret. Appl. Math. 45, 277\u2013289 (1993)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"260_CR19","first-page":"155","volume":"40","author":"T Chunling","year":"2009","unstructured":"Chunling, T., Xiaohui, L., Yuansheng, Y., Liping, W.: Irregular total labellings of some families of graphs. Indian J. Pure Appl. Math. 40(3), 155\u2013181 (2009)","journal-title":"Indian J. Pure Appl. Math."},{"key":"260_CR20","doi-asserted-by":"crossref","first-page":"1814","DOI":"10.1016\/j.mcm.2008.08.014","volume":"48","author":"T-L Kueng","year":"2008","unstructured":"Kueng, T.-L., Liang, T., Hsu, L.-H.: Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs. Math. Comput. Model. 48, 1814\u20131825 (2008)","journal-title":"Math. Comput. Model."},{"key":"260_CR21","unstructured":"Wang, D.I.: The Channel Assignment Problem and Closed Neighborhood Containment Graphs. Northeastern University, Boston, MA, Ph.D.Thesis (1985)"},{"key":"260_CR22","unstructured":"Zheng, Y.: Butterfly Network for Permutation or De-Permutation Utilized by Channel Algorithm. National Chiao Tung University, Alston Bird Llp (2007)"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0260-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-016-0260-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-016-0260-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T21:10:01Z","timestamp":1567717801000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-016-0260-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,28]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["260"],"URL":"https:\/\/doi.org\/10.1007\/s11786-016-0260-6","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,28]]}}}