{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T05:30:34Z","timestamp":1776231034870,"version":"3.50.1"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:p> The partially balanced incomplete block (PBIB)-designs and association schemes arising from different graph parameters is a well-studied concept. In this paper, we define and construct PBIB-designs with association schemes in strongly regular graphs through the nodes belonging to the diametral paths as blocks. A [Formula: see text]-design, called a diametral-design (in short) over a strongly regular graph [Formula: see text] of degree [Formula: see text], diameter [Formula: see text], is an ordered pair [Formula: see text], where [Formula: see text] and [Formula: see text] is the set of all diametral paths of [Formula: see text], called blocks, containing the nodes belonging to the diametral paths, satisfying the following conditions: (i) If [Formula: see text] and [Formula: see text], then there are exactly [Formula: see text] blocks containing [Formula: see text]; (ii) If [Formula: see text], [Formula: see text] and [Formula: see text], then there are exactly [Formula: see text]-blocks containing [Formula: see text]. We construct PBIB-designs with two-association schemes through diametral paths corresponding to the strongly regular graphs such as the square lattice graphs [Formula: see text], the triangular graphs [Formula: see text], the three Chang graphs, the Petersen graph, the Shrikhande graph, the Clebsch graph, the complement of Clebsch graph, the complement of Schl\u00e4fli graph, complete bipartite graphs, the Hoffman\u2013Singleton graph, etc. and in each case we give the composition of the diametral paths. These serve as extensions for the collection of near impossible class of strongly regular graphs with given parameters having two-association schemes. <\/jats:p>","DOI":"10.1142\/s1793830922501634","type":"journal-article","created":{"date-parts":[[2022,9,16]],"date-time":"2022-09-16T12:10:01Z","timestamp":1663330201000},"source":"Crossref","is-referenced-by-count":2,"title":["Partially balanced incomplete block (PBIB)-designs arising from diametral paths in some strongly regular graphs"],"prefix":"10.1142","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1548-1794","authenticated-orcid":false,"given":"Medha Itagi","family":"Huilgol","sequence":"first","affiliation":[{"name":"Department of Mathematics, Bengaluru City University, Central College Campus, Bengaluru 560 001, India"}]},{"given":"M. D.","family":"Vidya","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Bangalore University, Bengaluru 560 056, India"}]}],"member":"219","published-online":{"date-parts":[[2022,11,9]]},"reference":[{"key":"S1793830922501634BIB001","volume-title":"Theory of Graphs and its Applications","author":"Berge C.","year":"1962"},{"key":"S1793830922501634BIB002","doi-asserted-by":"crossref","first-page":"389","DOI":"10.2140\/pjm.1963.13.389","volume":"13","author":"Bose R. C.","year":"1963","journal-title":"Pacific J. Math."},{"key":"S1793830922501634BIB003","first-page":"337","volume":"4","author":"Bose R. C.","year":"1939","journal-title":"Sankhya"},{"key":"S1793830922501634BIB004","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1080\/01621459.1952.10501161","volume":"47","author":"Bose R. C.","year":"1952","journal-title":"J. Amer. Statist. Assoc."},{"key":"S1793830922501634BIB005","volume-title":"Distance in Graphs","author":"Buckley F.","year":"1990"},{"key":"S1793830922501634BIB006","first-page":"604","volume":"3","author":"Chang L. C.","year":"1959","journal-title":"Sci. Record Peking Math. (New Ser.)"},{"key":"S1793830922501634BIB007","doi-asserted-by":"crossref","first-page":"219","DOI":"10.6028\/jres.054.021","volume":"54","author":"Clatworthy W. H.","year":"1955","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"S1793830922501634BIB008","volume-title":"Handbook of Combinatorial Designs","author":"Colbourn C. J.","year":"2007","edition":"2"},{"key":"S1793830922501634BIB009","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/66443.66446","volume":"21","author":"Colbourn C. J.","year":"1989","journal-title":"ACM Comput. Surv."},{"key":"S1793830922501634BIB010","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"Godsil C.","year":"2001"},{"key":"S1793830922501634BIB011","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1017\/CBO9781107325579.015","volume-title":"Finite Geometries and Designs","author":"Haemers W. H.","year":"1981"},{"key":"S1793830922501634BIB012","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0378-3758(00)00289-5","volume":"95","author":"Ionin Y. J.","year":"2001","journal-title":"J. Statist. Plann. Inference"},{"key":"S1793830922501634BIB013","volume-title":"Design Theory","author":"Lindner C. C.","year":"2009","edition":"2"},{"key":"S1793830922501634BIB014","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/S0021-9800(66)80010-8","volume":"1","author":"Paola J. W.","year":"1966","journal-title":"J. Combin. Theory"},{"key":"S1793830922501634BIB015","volume-title":"Construction and Combinatorial Problems in Design of Experiments","author":"Raghavarao D.","year":"1971"},{"key":"S1793830922501634BIB016","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10623-009-9351-6","volume":"57","author":"Walikar H. B.","year":"2010","journal-title":"Des. Codes Cryptogr."}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830922501634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T09:10:28Z","timestamp":1689930628000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830922501634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,9]]},"references-count":16,"journal-issue":{"issue":"07","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["10.1142\/S1793830922501634"],"URL":"https:\/\/doi.org\/10.1142\/s1793830922501634","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,9]]},"article-number":"2250163"}}