{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:12:43Z","timestamp":1760080363893,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>A regular nonempty graph $\\Gamma$ is called edge regular, whenever there exists a nonegative integer $\\lambda_{\\Gamma}$, such that any two adjacent vertices of $\\Gamma$ have precisely $\\lambda_{\\Gamma}$ common neighbours. An edge regular graph $\\Gamma$ with at least one pair of vertices at distance 2 is called amply regular, whenever there exists a nonegative integer $\\mu_{\\Gamma}$, such that any two vertices at distance 2 have precisely $\\mu_{\\Gamma}$ common neighbours. In this paper we classify edge regular graphs, which can be obtained as a strong product, or a lexicographic product, or a deleted lexicographic product, or a co-normal product of two graphs. As a corollary we determine which of these graphs are amply regular.<\/jats:p>","DOI":"10.37236\/2817","type":"journal-article","created":{"date-parts":[[2020,1,11]],"date-time":"2020-01-11T02:56:53Z","timestamp":1578711413000},"source":"Crossref","is-referenced-by-count":5,"title":["Edge Regular Graph Products"],"prefix":"10.37236","volume":"20","author":[{"given":"Bo\u0161tjan","family":"Frelih","sequence":"first","affiliation":[]},{"given":"\u0160tefko","family":"Miklavi\u010d","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2013,3,24]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i1p62\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v20i1p62\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T11:25:10Z","timestamp":1579260310000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v20i1p62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,24]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2013,1,7]]}},"URL":"https:\/\/doi.org\/10.37236\/2817","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2013,3,24]]},"article-number":"P62"}}