{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:34:53Z","timestamp":1699835693578},"reference-count":6,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10359,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1978,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A graph H is called total if there exists a graph G such that there is a one\u2010to\u2010one correspondence between the vertices of H and the vertices and edges of G such that two vertices of H are adjacent iff the corresponding elements of G are adjacent or incident.<\/jats:p><jats:p>In this paper we present a linear time algorithm for the recognition of the total graphs. The algorithm is based on the breadth\u2010first search technique.<\/jats:p>","DOI":"10.1002\/net.3230080205","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T08:49:22Z","timestamp":1178873362000},"page":"121-133","source":"Crossref","is-referenced-by-count":9,"title":["A recognition algorithm for the total graphs"],"prefix":"10.1002","volume":"8","author":[{"given":"F.","family":"Gavril","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1090\/S0002-9939-1970-0266786-5","article-title":"A Characterization of Total Graphs","volume":"26","author":"Behzad M.","year":"1970","journal-title":"Proc. Amer. Math. Soc."},{"key":"e_1_2_1_3_2","volume-title":"Proc. of Conf. Combinatorial Mathematics","author":"Behzad M.","year":"1970"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"Behzad M. \u201cTotal Graphs Graph Theory and Applications \u201dProc. of Conf. Western Michigan University 1972","DOI":"10.1007\/BFb0067353"},{"key":"e_1_2_1_4_3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0067353"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1090\/S0002-9939-1968-0218271-5","article-title":"The Total Group of a Graph","volume":"19","author":"Behzad M.","year":"1968","journal-title":"Proc. Amer. Math. Soc."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1137\/0205021"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230080205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230080205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:35:44Z","timestamp":1699778144000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230080205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,6]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978,6]]}},"alternative-id":["10.1002\/net.3230080205"],"URL":"https:\/\/doi.org\/10.1002\/net.3230080205","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,6]]}}}