{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T18:00:01Z","timestamp":1781200801497,"version":"3.54.1"},"reference-count":30,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T00:00:00Z","timestamp":1611964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>In this paper, we study the existence, construction and number of (2-d)-kernels in the tensor product of paths, cycles and complete graphs. The symmetric distribution of (2-d)-kernels in these products helps us to characterize them. Among others, we show that the existence of (2-d)-kernels in the tensor product does not require the existence of a (2-d)-kernel in their factors. Moreover, we determine the number of (2-d)-kernels in the tensor product of certain factors using Padovan and Perrin numbers.<\/jats:p>","DOI":"10.3390\/sym13020230","type":"journal-article","created":{"date-parts":[[2021,1,30]],"date-time":"2021-01-30T06:22:20Z","timestamp":1611987740000},"page":"230","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On (2-d)-Kernels in the Tensor Product of Graphs"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1629-0167","authenticated-orcid":false,"given":"Pawe\u0142","family":"Bednarz","sequence":"first","affiliation":[{"name":"The Faculty of Mathematics and Applied Physics, Rzeszow University of Technology, Aleja Powsta\u0144c\u00f3w Warszawy 12, 35-959 Rzesz\u00f3w, Poland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2021,1,30]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Diestel, R. (2005). Graph Theory, Springer.","DOI":"10.4171\/owr\/2005\/03"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Hammack, R., Imrich, W., and Klav\u017ear, S. (2011). Handbook of Product Graphs, CRC Press, Inc.. [2nd ed.].","DOI":"10.1201\/b10959"},{"key":"ref_3","unstructured":"Morgenstern, O., and Von Neumann, J. (1944). Theory of Games and Economic Behavior, Princeton University Press."},{"key":"ref_4","unstructured":"Berge, C. (1973). Graphs and Hypergraphs, North-Holland."},{"key":"ref_5","first-page":"263","article-title":"Perfect graphs and kernels","volume":"16","author":"Berge","year":"1988","journal-title":"Bull. Inst. Math. Acad. Sin."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0012-365X(90)90346-J","article-title":"Recent problems and results about kernels in directed graphs","volume":"86","author":"Berge","year":"1990","journal-title":"Discret. Math."},{"key":"ref_7","first-page":"15","article-title":"On the existence of (k, l)-kernels in digraphs with a given circumference","volume":"10","author":"Arumugam","year":"2013","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"389","DOI":"10.7151\/dmgt.1369","article-title":"Monochromatic kernel-perfectness of special classes of digraphs","volume":"27","year":"2007","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_9","first-page":"353","article-title":"H-kernels in the D-join","volume":"98","year":"2011","journal-title":"Ars Comb."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.7151\/dmgt.1265","article-title":"On (k, l)-kernel perfectness of special classes of digraphs","volume":"25","author":"Kucharska","year":"2005","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"4616","DOI":"10.1016\/j.disc.2007.08.078","article-title":"On the existence and on the number of (k, l)-kernels in the lexicographic product of graphs","volume":"308","author":"Szumny","year":"2008","journal-title":"Discret. Math."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"431","DOI":"10.7151\/dmgt.1747","article-title":"On the existence of (k, l)-kernels in infinite digraphs: A survey","volume":"34","year":"2014","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.7151\/dmgt.1135","article-title":"On (k, l)-kernels of special superdigraphs of Pm and Cm","volume":"21","author":"Kucharska","year":"2001","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_14","first-page":"571","article-title":"On (k,l)-kernels in the corona of digraphs","volume":"53","year":"2009","journal-title":"Int. J. Pure Appl. Math."},{"key":"ref_15","first-page":"189","article-title":"Efficient dominating sets in graphs","volume":"189","author":"Bange","year":"1988","journal-title":"Appl. Discret. Math."},{"key":"ref_16","first-page":"103","article-title":"Secondary domination in graphs","volume":"5","author":"Hedetniemi","year":"2008","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"125155","DOI":"10.1016\/j.amc.2020.125155","article-title":"On the existence and the number of independent (1,2)-dominating sets in the G-join of graphs","volume":"377","author":"Michalski","year":"2020","journal-title":"Appl. Math. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0012-365X(99)00016-3","article-title":"Restrained domination in graphs","volume":"203","author":"Domke","year":"1999","journal-title":"Discret. Math."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s40995-020-00830-6","article-title":"Strong (1;1;2)-kernels in the corona of graphs and some realization problems","volume":"44","author":"Bednarz","year":"2020","journal-title":"Iran. J. Sci. Technol. Trans. Sci."},{"key":"ref_20","unstructured":"Fink, J.F., and Jacobson, M.S. (1985). n-domination in graphs. Graph Theory with Applications to Algorithms and Computer Science, John Wiley & Sons."},{"key":"ref_21","first-page":"273","article-title":"On 2-dominating kernels in graphs","volume":"53","year":"2012","journal-title":"Australas. J. Comb."},{"key":"ref_22","first-page":"215","article-title":"An algorithm determining (2-d)-kernels in trees","volume":"102","author":"Bednarz","year":"2017","journal-title":"Util. Math."},{"key":"ref_23","first-page":"1","article-title":"On (2-d)-kernels in the Cartesian product of graphs","volume":"70","author":"Bednarz","year":"2016","journal-title":"Ann. Univ. Mariae Curie-Sklodowska Sect. A"},{"key":"ref_24","first-page":"341","article-title":"On the existence and the number of (2-d)-kernels in graphs","volume":"121","author":"Bednarz","year":"2015","journal-title":"Ars Comb."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Gerbner, D., Keszegh, B., Methuku, A., Patk\u00f3s, B., and Vizer, M. (2017). An improvement on the maximum number of k-Dominating Independent Sets. arXiv.","DOI":"10.1002\/jgt.22422"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1016\/j.endm.2017.07.053","article-title":"Generalizing Erd\u0151s, Moon and Moser\u2019s result\u2014The number of k-dominating independent sets","volume":"61","author":"Nagy","year":"2017","journal-title":"Electron. Notes Discret. Math."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1002\/jgt.22042","article-title":"On the Number of k-Dominating Independent Sets","volume":"84","author":"Nagy","year":"2017","journal-title":"J. Graph Theory"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.akcej.2015.11.002","article-title":"The Fibonacci numbers of certain subgraphs of circulant graphs","volume":"12","year":"2015","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1090\/S0002-9939-1962-0133816-6","article-title":"The Kronecker product of graphs","volume":"13","author":"Weichsel","year":"1962","journal-title":"Proc. Am. Math. Soc."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/jgt.3190110403","article-title":"The number of maximal independent sets in connected graphs","volume":"11","year":"1987","journal-title":"J. Graph Theory"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/2\/230\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:17:28Z","timestamp":1760159848000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/2\/230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,30]]},"references-count":30,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2021,2]]}},"alternative-id":["sym13020230"],"URL":"https:\/\/doi.org\/10.3390\/sym13020230","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,30]]}}}