{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:16:32Z","timestamp":1648700192298},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1980,6,1]],"date-time":"1980-06-01T00:00:00Z","timestamp":328665600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12099,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1980,6]]},"DOI":"10.1016\/0304-3975(80)90041-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"117-121","source":"Crossref","is-referenced-by-count":1,"title":["Graph theoretic models"],"prefix":"10.1016","volume":"11","author":[{"given":"Frank","family":"Harary","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(80)90041-9_BIB1","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1021\/c160043a020","article-title":"The characteristic polynomial does not uniquely determine the topology of a molecule","volume":"11","author":"Balaban","year":"1971","journal-title":"J. Chemical Documentation"},{"key":"10.1016\/0304-3975(80)90041-9_BIB2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/jgt.3190030305","article-title":"Properties of almost all graphs and complexes","volume":"3","author":"Blass","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0304-3975(80)90041-9_BIB3","unstructured":"B. Bollob\u00e1s, Random graphs, to appear."},{"key":"10.1016\/0304-3975(80)90041-9_BIB4","first-page":"64","article-title":"Spektren endlicher Graphen","volume":"21","author":"Collatz","year":"1957","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0304-3975(80)90041-9_BIB5","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1002\/jgt.3190010410","article-title":"The graph isomorphism disease","volume":"1","author":"Corneil","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/0304-3975(80)90041-9_BIB6","series-title":"Graph Theory and Theoretical Physics","first-page":"167","article-title":"Graphs and matrices","author":"Dulmage","year":"1967"},{"key":"10.1016\/0304-3975(80)90041-9_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0012-365X(90)90283-N","article-title":"The smallest graphs with certain adjacency properties","volume":"29","author":"Exoo","year":"1980","journal-title":"Discrete Math."},{"key":"10.1016\/0304-3975(80)90041-9_BIB8","unstructured":"G. Exoo and F. Harary, An adjacency property of graphs involving four points, Theoret. Comput. Sci. to appear."},{"key":"10.1016\/0304-3975(80)90041-9_BIB9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.2307\/2272945","article-title":"Probabilities on finite models","volume":"41","author":"Fagin","year":"1976","journal-title":"J. Symbolic Logic"},{"issue":"B","key":"10.1016\/0304-3975(80)90041-9_BIB10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0095-8956(72)90026-3","article-title":"A simpler counterexample to the reconstruction conjecture for denumerable graphs","volume":"12","author":"Fisher","year":"1972","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0304-3975(80)90041-9_BIB11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/jgt.3190030202","article-title":"Further annotated bibliography on the isomorphism disease","volume":"3","author":"Gati","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/0304-3975(80)90041-9_BIB12","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/sapm1959381104","article-title":"A graph theoretic method for the complete reduction of a matrix with a view toward finding its eigenvalues","volume":"38","author":"Harary","year":"1959","journal-title":"J. Math. Physics"},{"key":"10.1016\/0304-3975(80)90041-9_BIB13","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01386304","article-title":"A graph theoretic approach to matrix inversion by partitioning","volume":"4","author":"Harary","year":"1962","journal-title":"Numer. Math."},{"key":"10.1016\/0304-3975(80)90041-9_BIB14","series-title":"Theory of Graphs and Its Applications","first-page":"47","article-title":"On the reconstruction of a graph from a collection of subgraphs","author":"Harary","year":"1964"},{"key":"10.1016\/0304-3975(80)90041-9_BIB15","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0304-3975(80)90041-9_BIB16","series-title":"Combinatorial Mathematics and Its Applications","first-page":"625","article-title":"Problems involving graphical numbers","author":"Harary","year":"1970"},{"key":"10.1016\/0304-3975(80)90041-9_BIB17","unstructured":"F. Harary, The Peterson graph and its unique features, S.E. Asian Bull. Math., to appear."},{"key":"10.1016\/0304-3975(80)90041-9_BIB18","doi-asserted-by":"crossref","unstructured":"F. Harary and J.A. Kabell, A simple algorithm to detect balance in signed graphs, Math. Soc. Sci., to appear.","DOI":"10.1016\/0165-4896(80)90010-4"},{"key":"10.1016\/0304-3975(80)90041-9_BIB19","series-title":"Structural Models: An Introduction to the Theory of Directed Graphs","author":"Harary","year":"1965"},{"key":"10.1016\/0304-3975(80)90041-9_BIB20","series-title":"Graphical Enumeration","author":"Harary","year":"1973"},{"key":"10.1016\/0304-3975(80)90041-9_BIB21","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1287\/mnsc.1.3-4.251","article-title":"Identification of the liaison persons of an organization using the structure matrix","volume":"1","author":"Harary","year":"1955","journal-title":"Management Sci."},{"key":"10.1016\/0304-3975(80)90041-9_BIB22","doi-asserted-by":"crossref","first-page":"205","DOI":"10.2307\/2785673","article-title":"A procedure for clique detection using the group matrix","volume":"20","author":"Harary","year":"1957","journal-title":"Sociometry"},{"key":"10.1016\/0304-3975(80)90041-9_BIB23","unstructured":"F. Harary and R. Statman, The graph isomorphism problem is equivalent to the legitimate deck problems for regular graphs, to appear."},{"key":"10.1016\/0304-3975(80)90041-9_BIB24","series-title":"New Directions in the Theory of Graphs","first-page":"275","article-title":"Almost all trees are conpectral","author":"Schwenk","year":"1973"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900419?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397580900419?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:24:42Z","timestamp":1555125882000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397580900419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,6]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,6]]}},"alternative-id":["0304397580900419"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(80)90041-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1980,6]]}}}