{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:24:40Z","timestamp":1775017480253,"version":"3.50.1"},"reference-count":22,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1134\/s0032946021040086","type":"journal-article","created":{"date-parts":[[2022,1,14]],"date-time":"2022-01-14T12:13:58Z","timestamp":1642162438000},"page":"380-401","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["New Modularity Bounds for Graphs $$G(n,r,s)$$ and $$G_p(n,r,s)$$"],"prefix":"10.1134","volume":"57","author":[{"given":"N. M.","family":"Derevyanko","sequence":"first","affiliation":[]},{"given":"M. M.","family":"Koshelev","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2022,1,14]]},"reference":[{"issue":"2","key":"5039_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1103\/PhysRevE.69.026113","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J. and Girvan, M., Finding and Evaluating Community Structure in Networks, Phys. Rev. E, 2004, vol.\u00a069, no.\u00a02, pp.\u00a0026113 (15 pp.). https:\/\/doi.org\/10.1103\/PhysRevE.69.026113","journal-title":"Phys. Rev. E"},{"issue":"6","key":"5039_CR2","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1103\/PhysRevE.84.066122","volume":"84","author":"A Lancichinetti","year":"2011","unstructured":"Lancichinetti, A. and Fortunato, S., Limits of Modularity Maximization in Community Detection, Phys. Rev. E, 2011, vol.\u00a084, no.\u00a06, pp.\u00a0066122 (8 pp.). https:\/\/doi.org\/10.1103\/PhysRevE.84.066122","journal-title":"Phys. Rev. E"},{"key":"5039_CR3","doi-asserted-by":"publisher","unstructured":"Miasnikof, P., Prokhorenkova, L., Shestopaloff, A.Y., and Raigorodskii, A., A Statistical Test of Heterogeneous Subgraph Densities to Assess Clusterability, Learning and Intelligent Optimization (13th Int. Conf. LION\u201913, Chania, Crete, Greece, May 27\u201331, 2019, Revised Selected Papers), Matsatsinis, N.F., Marinakis, Y., and Pardalos, P.M., Eds., Lect. Notes Comput. Sci., vol.\u00a011968, Cham: Springer, 2000, pp.\u00a017\u201329. https:\/\/doi.org\/10.1007\/978-3-030-38629-0_2","DOI":"10.1007\/978-3-030-38629-0_2"},{"issue":"6","key":"5039_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1103\/PhysRevE.69.066133","volume":"69","author":"MEJ Newman","year":"2004","unstructured":"Newman, M.E.J., Fast Algorithm for Detecting Community Structure in Networks, Phys. Rev. E, 2004, vol.\u00a069, no.\u00a06, pp.\u00a0066133 (5 pp.). https:\/\/doi.org\/10.1103\/PhysRevE.69.066133","journal-title":"Phys. Rev. E"},{"issue":"2","key":"5039_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s11590-016-1030-8","volume":"11","author":"L Ostroumova Prokhorenkova","year":"2017","unstructured":"Ostroumova Prokhorenkova, L., General Results on Preferential Attachment and Clustering Coefficient, Optim. Lett., 2017, vol.\u00a011, no.\u00a02, pp.\u00a0279\u2013298. https:\/\/doi.org\/10.1007\/s11590-016-1030-8","journal-title":"Optim. Lett."},{"issue":"9","key":"5039_CR6","first-page":"1082","volume":"56","author":"MA Porter","year":"2009","unstructured":"Porter, M.A., Onnela, J.-P., and Mucha, P.J., Communities in Networks, Notices Amer. Math. Soc., 2009, vol.\u00a056, no.\u00a09, pp.\u00a01082\u20131097. Available at https:\/\/www.ams.org\/notices\/200909\/rtx090901082p.pdf.","journal-title":"Notices Amer. Math. Soc."},{"key":"5039_CR7","doi-asserted-by":"publisher","unstructured":"Brandes, U., Delling, D., Gaertler, M., G\u00f6rke, R., Hoefer, M., Nikoloski, Z., and Wagner, D., On Finding Graph Clusterings with Maximum Modularity, Graph-Theoretic Concepts in Computer Science (33rd Int. Workshop WG\u20192007, Dornburg, Germany, June 21\u201323, 2007, Revised Papers), Brandstadt, A., Kratsch, D., and Muller, H., Eds., Lect. Notes Comput. Sci., vol.\u00a04769, Berlin: Springer, 2007, pp.\u00a0121\u2013132. https:\/\/doi.org\/10.1007\/978-3-540-74839-7_12","DOI":"10.1007\/978-3-540-74839-7_12"},{"key":"5039_CR8","doi-asserted-by":"publisher","unstructured":"De Montgolfier, F., Soto, M., and Viennot, L., Asymptotic Modularity of Some Graph Classes, Algorithms and Computation (Proc. 22nd Int. Sympos. ISAAC\u20192011, Yokahama, Japan, Dec. 5\u20138, 2011), Asano, T., Nakano, S., Okamoto, Y., and Watanabe, O., Eds., Lect. Notes Comput. Sci., vol.\u00a07074, Berlin: Springer, 2011, pp.\u00a0435\u2013444. https:\/\/doi.org\/10.1007\/978-3-642-25591-5_45","DOI":"10.1007\/978-3-642-25591-5_45"},{"issue":"7","key":"5039_CR9","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1140\/epjb\/e2012-20898-3","volume":"85","author":"S Trajanovski","year":"2012","unstructured":"Trajanovski, S., Wang, H., and Van Mieghem, P., Maximum Modular Graphs, Eur. Phys. J. B, 2012, vol.\u00a085, no.\u00a07, Art. 244 (14 pp.) https:\/\/doi.org\/10.1140\/epjb\/e2012-20898-3","journal-title":"Eur. Phys. J. B"},{"issue":"4","key":"5039_CR10","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1093\/comnet\/cnx046","volume":"6","author":"C McDiarmid","year":"2018","unstructured":"McDiarmid, C. and Skerman, F., Modularity of Regular and Treelike Graphs, J. Complex Netw., 2018, vol.\u00a06, no.\u00a04, pp.\u00a0596\u2013619. https:\/\/doi.org\/10.1093\/comnet\/cnx046","journal-title":"J. Complex Netw."},{"key":"5039_CR11","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1016\/j.endm.2017.07.058","volume":"61","author":"L Ostroumova Prokhorenkova","year":"2017","unstructured":"Ostroumova Prokhorenkova, L., Pra\u0142at, P., and Raigorodskii, A., Modularity in Several Random Graph Models, Electron. Notes Discrete Math., 2017, vol.\u00a061, pp.\u00a0947\u2013953. https:\/\/doi.org\/10.1016\/j.endm.2017.07.058","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"5039_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0195-6698(88)80014-3","volume":"9","author":"B Bollob\u00e1s","year":"1988","unstructured":"Bollob\u00e1s, B., The Isoperimetric Number of Random Regular Graphs, European J. Combin., 1988, vol.\u00a09, no.\u00a03, pp.\u00a0241\u2013244. https:\/\/doi.org\/10.1016\/S0195-6698(88)80014-3","journal-title":"European J. Combin."},{"issue":"1","key":"5039_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/rsa.20910","volume":"57","author":"C McDiarmid","year":"2020","unstructured":"McDiarmid, C. and Skerman, F., Modularity of Erd\u0151s-R\u00e9nyi Random Graphs, Random Structures Algorithms, 2020, vol.\u00a057, no.\u00a01, pp.\u00a0211\u2013243. https:\/\/doi.org\/10.1002\/rsa.20910","journal-title":"Random Structures Algorithms"},{"key":"5039_CR14","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.jcta.2015.08.002","volume":"137","author":"B Bollob\u00e1s","year":"2016","unstructured":"Bollob\u00e1s, B., Narayanan, B.P., and Raigorodskii, A.M., On the Stability of the Erd\u0151s-Ko-Rado Theorem, J. Combin. Theory Ser. A, 2016, vol.\u00a0137, pp.\u00a064\u201378. https:\/\/doi.org\/10.1016\/j.jcta.2015.08.002","journal-title":"J. Combin. Theory Ser. A"},{"key":"5039_CR15","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz\u2019, 1979."},{"issue":"4","key":"5039_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579457","volume":"1","author":"P Frankl","year":"1981","unstructured":"Frankl, P. and Wilson, R.M., Intersection Theorems with Geometric Consequences, Combinatorica, 1981, vol.\u00a01, no.\u00a04, pp.\u00a0357\u2013368. https:\/\/doi.org\/10.1007\/BF02579457","journal-title":"Combinatorica"},{"issue":"1","key":"5039_CR17","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1090\/S0273-0979-1993-00398-7","volume":"29","author":"J Kahn","year":"1993","unstructured":"Kahn, J. and Kalai, G., A Counterexample to Borsuk\u2019s Conjecture, Bull. Amer. Math. Soc. (N.S.), 1993, vol.\u00a029, no.\u00a01, pp.\u00a060\u201362. https:\/\/doi.org\/10.1090\/S0273-0979-1993-00398-7","journal-title":"Bull. Amer. Math. Soc. (N.S.)"},{"key":"5039_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10958-008-9196-y","volume":"23","author":"AM Raigorodskii","year":"2007","unstructured":"Raigorodskii, A.M., Around Borsuk\u2019s Hypothesis, Sovrem. Mat. Fundam. Napravl., 2007, vol.\u00a023, pp.\u00a0147\u2013164 [J. Math. Sci. (N.Y.) (Engl. Transl.), 2007, vol.\u00a0154, no.\u00a04, pp.\u00a0604\u2013623]. https:\/\/doi.org\/10.1007\/s10958-008-9196-y","journal-title":"Sovrem. Mat. Fundam. Napravl."},{"key":"5039_CR19","unstructured":"Ipatov, M.M., Koshelev, M.M., and Raigorodskii, A.M., Modularity of Some Distance Graphs, submitted to European J. Combin."},{"issue":"1","key":"5039_CR20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.2140\/moscow.2021.10.61","volume":"10","author":"MM Ipatov","year":"2021","unstructured":"Ipatov, M.M., Exact Modularity of Line Graphs of Complete Graphs, Moscow J. Comb. Number Theory, 2021, vol.\u00a010, no.\u00a01, pp.\u00a061\u201375. https:\/\/doi.org\/10.2140\/moscow.2021.10.61","journal-title":"Moscow J. Comb. Number Theory"},{"issue":"1","key":"5039_CR21","doi-asserted-by":"publisher","first-page":"77","DOI":"10.2140\/moscow.2021.10.77","volume":"10","author":"MM Koshelev","year":"2021","unstructured":"Koshelev, M.M., New Lower Bound on the Modularity of Johnson Graphs, Moscow J. Comb. Number Theory, 2021, vol.\u00a010, no.\u00a01, pp.\u00a077\u201382. https:\/\/doi.org\/10.2140\/moscow.2021.10.77","journal-title":"Moscow J. Comb. Number Theory"},{"issue":"301","key":"5039_CR22","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding, W., Probability Inequalities for Sums of Bounded Random Variables, J. Amer. Statist. Assoc., 1963, vol.\u00a058, no.\u00a0301, pp.\u00a013-30. https:\/\/doi.org\/10.2307\/2282952","journal-title":"J. Amer. Statist. Assoc."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946021040086.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946021040086","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946021040086.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:45:40Z","timestamp":1775011540000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946021040086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["5039"],"URL":"https:\/\/doi.org\/10.1134\/s0032946021040086","relation":{"is-translation-of":[{"id-type":"doi","id":"10.31857\/S0555292321040082","asserted-by":"subject"}]},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10]]},"assertion":[{"value":"22 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}