{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T16:18:20Z","timestamp":1767975500916,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,5,21]],"date-time":"2015-05-21T00:00:00Z","timestamp":1432166400000},"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":["Combinatorica"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s00493-015-2922-4","type":"journal-article","created":{"date-parts":[[2015,5,21]],"date-time":"2015-05-21T04:46:02Z","timestamp":1432183562000},"page":"655-668","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On order and rank of graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Ebrahim","family":"Ghorbani","sequence":"first","affiliation":[]},{"given":"Ali","family":"Mohammadian","sequence":"additional","affiliation":[]},{"given":"Behruz","family":"Tayfeh-Rezaie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,21]]},"reference":[{"key":"2922_CR1","unstructured":"S. Akbari, P. J. Cameron and G. B. Khosrovshahi: Ranks and signatures of adjacency matrices, unpublished manuscript."},{"key":"2922_CR2","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1002\/jgt.3190130413","volume":"13","author":"N. Alon","year":"1989","unstructured":"N. Alon and P. D. Seymour: A counterexample to the rank-coloring conjecture, J. Graph Theory 13 (1989), 523\u2013525.","journal-title":"J. Graph Theory"},{"key":"2922_CR3","volume-title":"Codes on Euclidean Spheres","author":"T. Ericson","year":"2001","unstructured":"T. Ericson and V. Zinoviev: Codes on Euclidean Spheres, North-Holland Mathematical Library, 63, North-Holland Publishing Co., Amsterdam, 2001."},{"key":"2922_CR4","doi-asserted-by":"crossref","first-page":"3498","DOI":"10.1016\/j.disc.2012.07.040","volume":"312","author":"E. Ghorbani","year":"2012","unstructured":"E. Ghorbani, A. Mohammadian and B. Tayfeh-Rezaie: Maximum order of trees and bipartite graphs with a given rank, Discrete Math. 312 (2012), 3498\u20133501.","journal-title":"Discrete Math."},{"key":"2922_CR5","doi-asserted-by":"crossref","unstructured":"E. Ghorbani, A. Mohammadian and B. Tayfeh-Rezaie: Maximum order of triangle-free graphs with a given rank, J. Graph Theory, in press","DOI":"10.1002\/jgt.21822"},{"key":"2922_CR6","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1006\/jctb.2000.2003","volume":"81","author":"C.D. Godsil","year":"2001","unstructured":"C.D. Godsil and G. F. Royle: Chromatic number and the 2-rank of a graph, J. Combin. Theory Ser. B 81 (2001), 142\u2013149.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2922_CR7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10623-011-9548-3","volume":"65","author":"W.H. Haemers","year":"2012","unstructured":"W.H. Haemers and M. J. P. Peeters: The maximum order of adjacency matrices of graphs with a given rank, Designs, Codes and Cryptography 65 (2012), 223\u2013232.","journal-title":"Designs, Codes and Cryptography"},{"key":"2922_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1097-0118(199709)26:1<1::AID-JGT1>3.0.CO;2-N","volume":"26","author":"A. Kotlov","year":"1997","unstructured":"A. Kotlov: Rank and chromatic number of a graph, J. Graph Theory 26 (1997), 1\u20138.","journal-title":"J. Graph Theory"},{"key":"2922_CR9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/(SICI)1097-0118(199610)23:2<185::AID-JGT9>3.0.CO;2-P","volume":"23","author":"A. Kotlov","year":"1996","unstructured":"A. Kotlov and L. Lov\u00e1sz: The rank and size of graphs, J. Graph Theory 23 (1996), 185\u2013189.","journal-title":"J. Graph Theory"},{"key":"2922_CR10","first-page":"81","volume-title":"Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science","author":"L. Lov\u00e1sz","year":"1988","unstructured":"L. Lov\u00e1sz and M. Saks: Lattices, M\u00f6bius functions and communication complexity, in: Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, 81\u201390."},{"key":"2922_CR11","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/0022-0000(93)90035-U","volume":"47","author":"L. Lov\u00e1sz","year":"1993","unstructured":"L. Lov\u00e1sz and M. Saks: Communication complexity and combinatorial lattice theory, J. Comput. System Sci. 47 (1993), 322\u2013349.","journal-title":"J. Comput. System Sci."},{"key":"2922_CR12","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01192527","volume":"15","author":"N. Nisan","year":"1995","unstructured":"N. Nisan and A. Wigderson: On rank vs. communication complexity, Combinatorica 15 (1995), 557\u2013565.","journal-title":"Combinatorica"},{"key":"2922_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.2307\/2318218","volume":"83","author":"C. Nuffelen van","year":"1976","unstructured":"C. van Nuffelen: A bound for the chromatic number of a graph, Amer. Math. Monthly 83 (1976), 265\u2013266.","journal-title":"Amer. Math. Monthly"},{"key":"2922_CR14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1017\/S2040618500033219","volume":"2","author":"R. A. Rankin","year":"1955","unstructured":"R. A. Rankin: The closest packing of spherical caps in n dimensions, Proc. Glasgow Math. Assoc. 2 (1955), 139\u2013144.","journal-title":"Proc. Glasgow Math. Assoc."},{"key":"2922_CR15","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0012-365X(92)90691-8","volume":"108","author":"A. A. Razborov","year":"1992","unstructured":"A. A. Razborov: The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear, Discrete Math. 108 (1992), 393\u2013396.","journal-title":"Discrete Math."},{"key":"2922_CR16","doi-asserted-by":"crossref","unstructured":"G. F. Royle: The rank of a cograph, Electron. J. Combin. 10 (2003).","DOI":"10.37236\/1751"},{"key":"2922_CR17","volume-title":"Sphere Packings","author":"C. Zong","year":"1999","unstructured":"C. Zong: Sphere Packings, Springer-Verlag, New York, 1999."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-2922-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-2922-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-2922-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T12:03:17Z","timestamp":1599048197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-2922-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,21]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["2922"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-2922-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,21]]}}}