{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T09:36:21Z","timestamp":1697967381826},"reference-count":45,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":11885,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1981]]},"DOI":"10.1016\/0012-365x(81)90273-9","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"289-311","source":"Crossref","is-referenced-by-count":4,"title":["Regular separable graphs of minimum order with given diameter"],"prefix":"10.1016","volume":"33","author":[{"given":"B.R.","family":"Myers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(81)90273-9_BIB1","first-page":"488","article-title":"On the construction of (d, k)-graphs","volume":"EC14","author":"Akers","year":"1966","journal-title":"IEEE Trans. Electronic Computers"},{"key":"10.1016\/0012-365X(81)90273-9_BIB2","first-page":"3","article-title":"On the diameters of reduced automat.","volume":"9","author":"Barzdin","year":"1967","journal-title":"Diskret. Analiz."},{"key":"10.1016\/0012-365X(81)90273-9_BIB3","series-title":"Th\u00e9rie des Graphes et ses Applications","author":"Berge","year":"1962"},{"key":"10.1016\/0012-365X(81)90273-9_BIB4","first-page":"2119","article-title":"Efficient communication networks","author":"Bratton","year":"1955","journal-title":"Cowles Commission Discussion Paper"},{"key":"10.1016\/0012-365X(81)90273-9_BIB5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF01894682","article-title":"A problem in the theory of communications networks","volume":"19","author":"Bollob\u00e1s","year":"1968","journal-title":"Acta. Math. Acad. Sci. Hungar."},{"key":"10.1016\/0012-365X(81)90273-9_BIB6","series-title":"Theory of Graphs","first-page":"29","article-title":"Graphs of given diameter","author":"Bollob\u00e1s","year":"1968"},{"key":"10.1016\/0012-365X(81)90273-9_BIB7","series-title":"Combinatorial Mathematics and its applications","first-page":"25","article-title":"Graphs with given diameter and maximal valency","author":"Bollob\u00e1s","year":"1969"},{"key":"10.1016\/0012-365X(81)90273-9_BIB8","first-page":"3","article-title":"Graphs with given diameter and minimal degree","volume":"2","author":"Bollob\u00e1s","year":"1976","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(81)90273-9_BIB9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0095-8956(76)80003-2","article-title":"On graphs with diameter 2","volume":"21","author":"Bollob\u00e1s","year":"1976","journal-title":"J. Comb. Theory (B)"},{"key":"10.1016\/0012-365X(81)90273-9_BIB10","doi-asserted-by":"crossref","first-page":"281","DOI":"10.2307\/2690069","article-title":"An extremal problem of graphs with diameter 2","volume":"48","author":"Bollob\u00e1s","year":"1975","journal-title":"Math. Mag."},{"key":"10.1016\/0012-365X(81)90273-9_BIB11","first-page":"281","article-title":"Extremal graphs with given diameter and connectivity","volume":"1","author":"Bollob\u00e1s","year":"1976","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(81)90273-9_BIB12","first-page":"239","article-title":"Extremal graphs of diameter 2 with prescribed minimum degree","volume":"7","author":"Bondy","year":"1972","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0012-365X(81)90273-9_BIB13","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(81)90273-9_BIB14","series-title":"Ph.D. thesis","article-title":"Some Problems in Extremal Graph Theory","author":"Caccetta","year":"1976"},{"key":"10.1016\/0012-365X(81)90273-9_BIB15","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0095-8956(76)90050-2","article-title":"Extremal graphs of diameter 4","volume":"21","author":"Caccetta","year":"1976","journal-title":"J. Comb. Theory (B)"},{"key":"10.1016\/0012-365X(81)90273-9_BIB16","first-page":"33","article-title":"A problem in extremal graph theory","volume":"2","author":"Caccetta","year":"1976","journal-title":"Ars Combinatoria"},{"key":"10.1016\/0012-365X(81)90273-9_BIB17","first-page":"133","article-title":"Topological constraints on interconnection limited logic","author":"Elspas","year":"1964","journal-title":"Proc. Fifth Annual Symposium on Switching Circuit Theory and Logical Design, IEEE Special Publications S-164"},{"key":"10.1016\/0012-365X(81)90273-9_BIB18","first-page":"215","article-title":"On a problem in graph theory","volume":"1","author":"Erd\u00f6s","year":"1966","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0012-365X(81)90273-9_BIB19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1109\/PGEC.1966.264310","article-title":"A design for (d, k)-graphs","volume":"EC15","author":"Friedman","year":"1966","journal-title":"IEEE Trans. Electronic Computers"},{"key":"10.1016\/0012-365X(81)90273-9_BIB20","series-title":"Convex Polytopes","author":"Gr\u00fcnbaum","year":"1976"},{"key":"10.1016\/0012-365X(81)90273-9_BIB21","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1112\/jlms\/s1-37.1.152","article-title":"Longest simple paths in polyhedral graphs","volume":"37","author":"Gr\u00fcnbaum","year":"1962","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(81)90273-9_BIB22","series-title":"Structural Models and Introduction to the Theory of Graphs","author":"Harary","year":"1965"},{"key":"10.1016\/0012-365X(81)90273-9_BIB23","doi-asserted-by":"crossref","first-page":"1142","DOI":"10.1073\/pnas.48.7.1142","article-title":"The maximum connectivity of a graph","volume":"48","author":"Harary","year":"1962","journal-title":"Proc. Nat. Acad. Sci."},{"key":"10.1016\/0012-365X(81)90273-9_BIB24","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(81)90273-9_BIB25","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1147\/rd.45.0497","article-title":"On Moore graphs with diameters 2 and 3","volume":"4","author":"Hoffman","year":"1960","journal-title":"IBM J. of Research and Development"},{"key":"10.1016\/0012-365X(81)90273-9_BIB26","doi-asserted-by":"crossref","first-page":"602","DOI":"10.4153\/CJM-1964-061-2","article-title":"Diameters of polyhedral graphs","volume":"16","author":"Klee","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/0012-365X(81)90273-9_BIB27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0095-8956(77)90059-4","article-title":"Classifications and enumeration of minimum (d, 1.3)-graphs and minimum (d, 2, 3)-graphs","volume":"23","author":"Klee","year":"1977","journal-title":"J. Comb. Theory B"},{"key":"10.1016\/0012-365X(81)90273-9_BIB28","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1287\/moor.1.1.28","article-title":"Minimum graphs of specified diameter, connectivity and valence","volume":"1","author":"Klee","year":"1976","journal-title":"I. Mathematics of Operations Research"},{"key":"10.1016\/0012-365X(81)90273-9_BIB29","unstructured":"V. Klee, Classification and enumeration of minimum (d, 3, 3)-graphs for odd d, J. Comb. Theory (B), to appear."},{"key":"10.1016\/0012-365X(81)90273-9_BIB30","unstructured":"V. Klee and H. Quaife, Minimum graphs of specified diameter, connectivity and valence II, to appear."},{"key":"10.1016\/0012-365X(81)90273-9_BIB31","series-title":"Introduction to the theory of finite automata","author":"Kobrinskii","year":"1962"},{"key":"10.1016\/0012-365X(81)90273-9_BIB32","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/PGEC.1967.264615","article-title":"On (d, k)-graphs","volume":"EC16","author":"Korn","year":"1967","journal-title":"IEEE Trans. Electronic Computers"},{"key":"10.1016\/0012-365X(81)90273-9_BIB33","first-page":"1133","article-title":"Number, degree of distinguishability and diameter of commutative automata and operators realized by them","volume":"9","author":"Korshnov","year":"1968","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0012-365X(81)90273-9_BIB34","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02289199","article-title":"Connectivity and generalized cliques in sociometric group structure","volume":"15","author":"Luce","year":"1950","journal-title":"Psychometrika"},{"key":"10.1016\/0012-365X(81)90273-9_BIB35","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1307\/mmj\/1028999370","article-title":"On the diameter of a graph","volume":"12","author":"Moon","year":"1965","journal-title":"Michigan Math. J."},{"key":"10.1016\/0012-365X(81)90273-9_BIB36","article-title":"Extremal Graph-Theoretic Problems with Applications","author":"Murty","year":"1966","journal-title":"Ph.D. Thesis"},{"key":"10.1016\/0012-365X(81)90273-9_BIB37","doi-asserted-by":"crossref","first-page":"138","DOI":"10.2307\/2688184","article-title":"Critical graphs of diameter 2","volume":"41","author":"Murty","year":"1968","journal-title":"Math. Mag."},{"key":"10.1016\/0012-365X(81)90273-9_BIB38","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF01894681","article-title":"On some extremal graphs","volume":"19","author":"Murty","year":"1968","journal-title":"Acta. Math. Acad. Sci. Hungar."},{"key":"10.1016\/0012-365X(81)90273-9_BIB39","series-title":"Proc. of The Second Ann Arbor Graph Theory Conference, Ann Arbor, Michigan","first-page":"111","article-title":"Extremal nonseparable graphs of diameter 2","author":"Murty","year":"1969"},{"key":"10.1016\/0012-365X(81)90273-9_BIB40","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/TCS.1980.1084800","article-title":"The Klee and Quaife minimum (d, 1, 3)-graphs revisited","volume":"CAS-27","author":"Myers","year":"1980","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0012-365X(81)90273-9_BIB41","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1109\/TCS.1980.1084880","article-title":"The minimum-order three-connected cubic graphs with specified diameters","volume":"CAS-27","author":"Myers","year":"1980","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0012-365X(81)90273-9_BIB42","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/T-C.1969.222642","article-title":"On (d, k, \u03c8)-graphs","volume":"C-18","author":"Quiafe","year":"1969","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0012-365X(81)90273-9_BIB43","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.1109\/T-C.1970.222861","article-title":"Improved construction techniques for (d, k)-graph","volume":"C-19","author":"Storwick","year":"1970","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0012-365X(81)90273-9_BIB44","first-page":"1005","article-title":"On operators realizable in logical nets","volume":"112","author":"Trahtenbrot","year":"1957","journal-title":"Dokl., Akad. Nauk SSR"},{"key":"10.1016\/0012-365X(81)90273-9_BIB45","article-title":"On accessibility in graphs","author":"Vijayan","year":"1964","journal-title":"Sankhy\u0101 (A)"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902739?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X81902739?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T12:21:48Z","timestamp":1554898908000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X81902739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981]]}},"alternative-id":["0012365X81902739"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(81)90273-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}