{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:09:44Z","timestamp":1771610984039,"version":"3.50.1"},"reference-count":96,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T00:00:00Z","timestamp":1672790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper provides new observations on the Lov\u00e1sz \u03b8-function of graphs. These include a simple closed-form expression of that function for all strongly regular graphs, together with upper and lower bounds on that function for all regular graphs. These bounds are expressed in terms of the second-largest and smallest eigenvalues of the adjacency matrix of the regular graph, together with sufficient conditions for equalities (the upper bound is due to Lov\u00e1sz, followed by a new sufficient condition for its tightness). These results are shown to be useful in many ways, leading to the determination of the exact value of the Shannon capacity of various graphs, eigenvalue inequalities, and bounds on the clique and chromatic numbers of graphs. Since the Lov\u00e1sz \u03b8-function factorizes for the strong product of graphs, the results are also particularly useful for parameters of strong products or strong powers of graphs. Bounds on the smallest and second-largest eigenvalues of strong products of regular graphs are consequently derived, expressed as functions of the Lov\u00e1sz \u03b8-function (or the smallest eigenvalue) of each factor. The resulting lower bound on the second-largest eigenvalue of a k-fold strong power of a regular graph is compared to the Alon\u2013Boppana bound; under a certain condition, the new bound is superior in its exponential growth rate (in k). Lower bounds on the chromatic number of strong products of graphs are expressed in terms of the order and the Lov\u00e1sz \u03b8-function of each factor. The utility of these bounds is exemplified, leading in some cases to an exact determination of the chromatic numbers of strong products or strong powers of graphs. The present research paper is aimed to have tutorial value as well.<\/jats:p>","DOI":"10.3390\/e25010104","type":"journal-article","created":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T03:27:44Z","timestamp":1672802864000},"page":"104","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Observations on the Lov\u00e1sz \u03b8-Function, Graph Capacity, Eigenvalues, and Strong Products \u2020"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5681-1273","authenticated-orcid":false,"given":"Igal","family":"Sason","sequence":"first","affiliation":[{"name":"Andrew & Erna Viterbi Faculty of Electrical and Computer Engineering, Technion\u2014Israel Institute of Technology, Haifa 3200003, Israel"},{"name":"Faculty of Mathematics, Technion\u2014Israel Institute of Technology, Haifa 3200003, Israel"}]}],"member":"1968","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TIT.1956.1056798","article-title":"The zero error capacity of a noisy channel","volume":"2","author":"Shannon","year":"1956","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","unstructured":"Berge, C. (1973). Graphs and Hypergraphs, American Elsevier Publishing Company. North-Holland Mathematical Library."},{"key":"ref_3","first-page":"11","article-title":"Graph powers","volume":"Volume 10","year":"2002","journal-title":"Contemporary Combinatorics"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/BF01162967","article-title":"Graph multiplication","volume":"72","author":"Sabidussi","year":"1960","journal-title":"Math. Z."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1193","article-title":"The sandwich theorem","volume":"1","author":"Knuth","year":"1994","journal-title":"Electron. J. Comb."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","article-title":"On the Shannon capacity of a graph","volume":"25","year":"1979","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1109\/TIT.1979.1056027","article-title":"On some problems of Lov\u00e1sz concerning the Shannon capacity of a graph","volume":"25","author":"Haemers","year":"1979","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-662-59204-5_1","article-title":"Lov\u00e1sz, vectors, graphs and codes","volume":"Volume 28","author":"Katona","year":"2019","journal-title":"Building Bridges II\u2014Mathematics of L\u00e1szl\u00f3 Lov\u00e1sz"},{"key":"ref_9","unstructured":"Gancarzewicz, G., and Skrzy\u0144ski, M. (2014). A survey on known values and bounds on the Shannon capacity. Selected Topics in Modern Mathematics, Publishing House AKAPIT."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2207","DOI":"10.1109\/18.720537","article-title":"Zero-error information theory","volume":"44","author":"Orlitsky","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Hammack, R., Imrich, W., and Klav\u017ear, S. (2011). Handbook of Product Graphs, CRC Press. [2nd ed.].","DOI":"10.1201\/b10959"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0012-365X(92)90280-S","article-title":"Finding the prime factors of strong direct product graphs in polynomial time","volume":"109","author":"Feigenbaum","year":"1992","journal-title":"Discret. Math."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TIT.1976.1055607","article-title":"The zero-error side information problem and chromatic numbers","volume":"22","author":"Witsenhausen","year":"1976","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.dam.2016.04.028","article-title":"A new property of the Lov\u00e1sz number and duality relations between graph parameters","volume":"216","author":"Duanc","year":"2017","journal-title":"Discret. Appl. Math."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2172","DOI":"10.1109\/TIT.2006.872856","article-title":"The Shannon capacity of a graph and the independence numbers of its powers","volume":"52","author":"Alon","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TIT.2002.808128","article-title":"A nontrivial lower bound on the Shannon capacities of the complements of odd cycles","volume":"49","author":"Bohman","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"N26","DOI":"10.37236\/264","article-title":"Maximum independent sets in certain powers of odd cycles","volume":"16","author":"Bohman","year":"2009","journal-title":"Electron. J. Comb."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"P10","DOI":"10.37236\/2598","article-title":"On the independence numbers of the cubes of odd cycles","volume":"20","author":"Bohman","year":"2013","journal-title":"Electron. J. Comb."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"49","DOI":"10.4064\/cm-25-1-49-52","article-title":"On chromatic number of products of two graphs","volume":"25","author":"Borowiecki","year":"1972","journal-title":"Colloq. Math."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Hrommkovi\u010d, J., Nagl, M., and Westfechtel, B. (2004). Efficient computation of the Lov\u00e1sz number of certain circulant graphs. Graph-Theoretic Concepts in Computer Science, Springer. LNCS 3353.","DOI":"10.1007\/978-3-540-30559-0_24"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1812","DOI":"10.1016\/j.dam.2007.03.015","article-title":"Algorithmic and explicit determination of the Lov\u00e1sz number for certain circulant graphs","volume":"155","author":"Brimkov","year":"2007","journal-title":"Discret. Appl. Math."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"45","DOI":"10.2140\/pjm.1971.37.45","article-title":"Ramsey bounds for graph products","volume":"37","author":"McEliece","year":"1971","journal-title":"Pac. J. Math."},{"key":"ref_23","unstructured":"Esperet, L., and Wood, D.R. (2022). Colouring strong products. arXiv."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s00373-018-1876-x","article-title":"Total colorings of product graphs","volume":"34","author":"Geetha","year":"2018","journal-title":"Graphs And Comb."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s00493-014-3132-1","article-title":"Sabidussi versus Hedetniemi for three variations of the chromatic number","volume":"36","author":"Godsil","year":"2016","journal-title":"Combinatorica"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1109\/18.54907","article-title":"On graphs in which the Shannon capacity is unachievable by finite product","volume":"36","author":"Guo","year":"1990","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0095-8956(73)90014-2","article-title":"Numerical invariants and the strong product of graphs","volume":"15","author":"Hales","year":"1973","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1007\/s10801-015-0660-8","article-title":"Edge-transitive products","volume":"43","author":"Hammack","year":"2016","journal-title":"J. Algebraic Comb."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"2229","DOI":"10.1137\/17M115565X","article-title":"A bound on the Shannon capacity via a linear programming variation","volume":"32","author":"Hu","year":"2018","journal-title":"SIAM J. Discret. Math."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01855874","article-title":"Strong products of \u03c7-critical graphs","volume":"45","year":"1993","journal-title":"Aequationes Mathematicae"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(94)00377-U","article-title":"Coloring graph products\u2014A survey","volume":"155","year":"1996","journal-title":"Discret. Math."},{"key":"ref_32","first-page":"287","article-title":"Strong products of Kneser graphs","volume":"133","year":"1994","journal-title":"Discret. Math."},{"key":"ref_33","first-page":"620","article-title":"On the transitivity of the strong product of graphs","volume":"30","author":"Dong","year":"2015","journal-title":"Chin. Q. J. Math."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"1706","DOI":"10.1214\/aoms\/1177693169","article-title":"Hide and seek, data storage, and entropy","volume":"42","author":"McEliece","year":"1971","journal-title":"Ann. Math. Stat."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0095-8956(74)90081-1","article-title":"Independence numbers of product graphs","volume":"17","author":"Sonnemann","year":"1974","journal-title":"J. Comb. Theory Ser. B"},{"key":"ref_36","first-page":"207","article-title":"Some remarks on the chromatic number of the strong product of graphs","volume":"4","author":"Vesztergombi","year":"1979","journal-title":"Acta Cybern."},{"key":"ref_37","unstructured":"S\u00f3s, V.T., and Lov\u00e1sz, L. (1981). Chromatic number of strong product of graphs. Algebraic Methods in Graph Theory, Elsevier."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"4767","DOI":"10.1109\/TIT.2013.2256951","article-title":"Bounds on Shannon capacity and Ramsey numbers from product of graphs","volume":"59","author":"Xu","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Brouwer, A.E., and Haemers, W.H. (2011). Spectra of Graphs, Springer.","DOI":"10.1007\/978-1-4614-1939-6"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Cioab\u01ce, S.M., and Murty, M.R. (2022). A First Course in Graph Theory and Combinatorics, Springer. [2nd ed.].","DOI":"10.1007\/978-981-19-0957-3"},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Cvetkovi\u0107, D., Rowlinson, P., and Simi\u0107, S. (2009). An Introduction to the Theory of Graph Spectra, Cambridge University Press. London Mathematical Society Student Texts 75.","DOI":"10.1017\/CBO9780511801518"},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Naumann, U., and Schenk, O. (2012). Spectral graph theory. Combinatorial Scientific Computing, Chapman & Hall CRC Press. Chapter 18.","DOI":"10.1201\/b11644"},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Stani\u0107, Z. (2015). Inequalities for Graph Eigenvalues, Cambridge University Press.","DOI":"10.1017\/CBO9781316341308"},{"key":"ref_44","doi-asserted-by":"crossref","unstructured":"Chartrand, G., Lesniak, L., and Zhang, P. (2015). Graphs and Digraphs, CRC Press. [6th ed.].","DOI":"10.1201\/b19731"},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Godsil, C., and Royle, G. (2001). Algebraic Graph Theory, Springer.","DOI":"10.1007\/978-1-4613-0163-9"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0012-365X(91)90112-F","article-title":"On the second eigenvalue of a graph","volume":"91","author":"Nilli","year":"1991","journal-title":"Discret. Math."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02579166","article-title":"Eigenvalues and expanders","volume":"6","author":"Alon","year":"1986","journal-title":"Combinatorica"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1137\/19M1257135","article-title":"Graph powering and spectral robustness","volume":"2","author":"Abbe","year":"2020","journal-title":"SIAM J. Math. Data Sci."},{"key":"ref_49","unstructured":"Abbe, E., and Ralli, P. (2020). An Alon-Boppana theorem for powered graphs, and generalized Ramanujan graphs. arXiv."},{"key":"ref_50","unstructured":"Abbe, E., and Ralli, P. (2022, January 2\u20134). An Alon-Boppana theorem for powered graphs, generalized Ramanujan graphs and robust community detection. Proceedings of the 2022 International Zurich Seminar on Information and Communication, Zurich, Switzerland."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.jctb.2005.09.002","article-title":"On the extreme eigenvalues of regular graphs","volume":"96","year":"2006","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"ref_52","first-page":"745","article-title":"Expander graphs and gaps between primes","volume":"20","author":"Murty","year":"2008","journal-title":"Forum Math."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01275669","article-title":"On the second eigenvalue and random walks in random d-regular graphs","volume":"11","author":"Friedman","year":"1991","journal-title":"Combinatorica"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1215\/S0012-7094-93-06921-9","article-title":"Some geometric aspects of graphs and their eigenfunctions","volume":"69","author":"Friedman","year":"1993","journal-title":"Duke Math. J."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Friedman, J. (2008). A Proof of Alon\u2019s Second Eigenvalue Conjecture and Related Problems, Memoirs of the American Mathematical Society. no. 910.","DOI":"10.1090\/memo\/0910"},{"key":"ref_56","first-page":"907","article-title":"On negative eigenvalues of regular graphs","volume":"333","author":"Li","year":"2001","journal-title":"Comptes Rendus l\u2019Acad\u00e9mie Sci.-Ser. I-Math."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"N9","DOI":"10.37236\/1850","article-title":"Tight estimates for eigenvalues of regular graphs","volume":"11","author":"Nilli","year":"2004","journal-title":"Electron. J. Comb."},{"key":"ref_58","first-page":"91","article-title":"Ramanujan graphs: An introduction","volume":"6","author":"Murty","year":"2020","journal-title":"Indian J. Discret. Math."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"307","DOI":"10.4007\/annals.2015.182.1.7","article-title":"Interlacing families I: Bipartite Ramanujan graphs of all degrees","volume":"182","author":"Marcus","year":"2015","journal-title":"Ann. Math."},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Brouwer, A.E., and Van Maldeghem, H. (2022). Strongly Regular Graphs, Cambridge University Press.","DOI":"10.1017\/9781009057226"},{"key":"ref_61","first-page":"168","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Schrijver","year":"1981","journal-title":"Combinatorica"},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L. (1986). An Algorithmic Theory of Numbers, Graphs and Convexity, SIAM.","DOI":"10.1137\/1.9781611970203"},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L. (2019). Graphs and Geometry, American Mathematical Society, Colloquium Publications.","DOI":"10.1090\/coll\/065"},{"key":"ref_64","doi-asserted-by":"crossref","unstructured":"Aigner, M., and Ziegler, G.M. (2018). Proofs from the Book, Springer. [6th ed.].","DOI":"10.1007\/978-3-662-57265-8"},{"key":"ref_65","unstructured":"(2021, January 01). The Sage Developers, SageMath, the Sage Mathematics Software System (Version 9.2). Available online: http:\/\/www.sagemath.org\/."},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.disc.2006.07.035","article-title":"Eigenvalue problems of Nordhaus\u2013Gaddum type","volume":"307","author":"Nikiforov","year":"2007","journal-title":"Discret. Math."},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.laa.2014.03.024","article-title":"More eigenvalue problems of Nordhaus\u2013Gaddum type","volume":"451","author":"Nikiforov","year":"2014","journal-title":"Linear Algebr. Its Appl."},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"175","DOI":"10.2307\/2306658","article-title":"On complementary graphs","volume":"63","author":"Nordhaus","year":"1956","journal-title":"Am. Math. Mon."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1006\/jabr.2000.8714","article-title":"All self-complementary symmetric graphs","volume":"240","author":"Peisert","year":"2001","journal-title":"J. Algebra"},{"key":"ref_70","unstructured":"Mullin, N.E. (2009). Self-Complementary Arc-Transitive Graphs and Their Imposters. [Master\u2019s Thesis, University of Waterloo]."},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF01161408","article-title":"Cliques and claws in edge-transitive strongly regular graphs","volume":"174","author":"Neumaier","year":"1980","journal-title":"Math. Z."},{"key":"ref_72","doi-asserted-by":"crossref","unstructured":"Cameron, P.J., Hirschfeld, J.W.P., and Hughes, D.R. (1981). Regular cliques in graphs and special 112 designs. Finite Geometries and Designs (Proceedings of the Second Isle of Thorns Conference 1980), Cambridge University Press.","DOI":"10.1017\/CBO9781107325579"},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"137","DOI":"10.26493\/1855-3974.109.97f","article-title":"Strongly regular edge-transitive graphs","volume":"2","author":"Morris","year":"2009","journal-title":"Ars Math. Contemp."},{"key":"ref_74","unstructured":"Haemers, W. (1979). Eigenvalue Techniques in Design and Graph Theory. [Ph.D. Dissertation, Stichting Mathematisch Centrum]."},{"key":"ref_75","unstructured":"Dowling, M.C. (2016). Expander Graphs and Coding Theory. [Ph.D. Dissertation, Clemson University]. Available online: https:\/\/tigerprints.clemson.edu\/all_dissertations\/1736."},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","article-title":"Expander graphs and their applications","volume":"43","author":"Hoory","year":"2006","journal-title":"Bull. Am. Math. Soc."},{"key":"ref_77","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1145\/210118.210136","article-title":"Eigenvalues and expansion of regular graphs","volume":"42","author":"Kahale","year":"1995","journal-title":"J. Assoc. Comput. Mach."},{"key":"ref_78","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1017\/9781108649094.005","article-title":"Expanders\u2014How to find them, and what to find in them","volume":"Volume 4","author":"Krivelevich","year":"2019","journal-title":"Surveys in Combinatorics 2019"},{"key":"ref_79","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1090\/S0273-0979-2011-01359-3","article-title":"Expander graphs in pure and applied mathematics","volume":"49","author":"Lubotzky","year":"2012","journal-title":"Bull. Am. Math. Soc."},{"key":"ref_80","unstructured":"Wei, V.K. (1981). A Lower Bound on the Stability Number of a Simple Graph, Bell Laboratories Technical Memorandum. 81\u201311217\u20139."},{"key":"ref_81","unstructured":"Alon, N., and Spencer, J.H. (2016). The Probabilistic Method, John Wiley & Sons. [4th ed.]."},{"key":"ref_82","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0095-8956(83)90003-5","article-title":"Lower bounds on the independence number in terms of the degrees","volume":"34","author":"Griggs","year":"1983","journal-title":"J. Comb. Theory Ser. B"},{"key":"ref_83","first-page":"147","article-title":"On finite graphs that are self-complementary and vertex-transitive","volume":"18","author":"Li","year":"1998","journal-title":"Australas. J. Comb."},{"key":"ref_84","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1017\/S0004972713000427","article-title":"Self-complementary vertex-transitive graphs of order a product of two primes","volume":"89","author":"Li","year":"2014","journal-title":"Bull. Aust. Math. Soc."},{"key":"ref_85","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1017\/S1446788720000488","article-title":"New constructions of self-complementary Cayley graphs","volume":"111","author":"Li","year":"2021","journal-title":"J. Aust. Math. Soc."},{"key":"ref_86","unstructured":"Rao, G. (2014). Self-Complementary Vertex-Transitive Graphs. [Ph.D. Dissertation, The University of Western Australia]. Available online: https:\/\/api.research-repository.uwa.edu.au\/ws\/portalfiles\/portal\/5338639\/Rao_Guang_2014.pdf."},{"key":"ref_87","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1017\/S0004972716000290","article-title":"Self-complementary vertex-transitive graphs","volume":"94","author":"Rao","year":"2016","journal-title":"Bull. Aust. Soc."},{"key":"ref_88","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/jgt.3190180210","article-title":"A characterization of the smallest eigenvalue of a graph","volume":"18","author":"Desai","year":"1994","journal-title":"J. Graph Theory"},{"key":"ref_89","doi-asserted-by":"crossref","first-page":"467","DOI":"10.7151\/dmgt.2285","article-title":"Some observations on the smallest adjacency eigenvalue of a graph","volume":"40","author":"Elzinga","year":"2020","journal-title":"Discuss. Math. Graph Theory"},{"key":"ref_90","unstructured":"Cioab\u01ce, S.M., and Gupta, V. (2022). A lower bound for the smallest eigenvalue of a graph and an application to the associahedron graph. arXiv."},{"key":"ref_91","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.laa.2012.02.004","article-title":"Sharp upper bounds on the second largest eigenvalues of connected graphs","volume":"437","author":"Zhai","year":"2012","journal-title":"Linear Algebra Its Appl."},{"key":"ref_92","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0012-365X(93)90007-G","article-title":"Bounds on eigenvalues of graphs","volume":"123","author":"Hong","year":"1993","journal-title":"Discret. Math."},{"key":"ref_93","unstructured":"Harris, B. (1970). On eigenvalues and colorings of graphs. Graph Theory and Its Applications, Academic Press."},{"key":"ref_94","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1112\/jlms\/s1-42.1.330","article-title":"The eigenvalues of a graph and its chromatic number","volume":"s1\u201342","author":"Wilf","year":"1967","journal-title":"J. Lond. Math. Soc."},{"key":"ref_95","first-page":"1005","article-title":"High dimensional Hoffman bound and applications in extremal combinatorics","volume":"4","author":"Filmus","year":"2021","journal-title":"J. Algebr. Comb."},{"key":"ref_96","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.laa.2021.02.010","article-title":"Hoffman\u2019s ratio bound","volume":"617","author":"Haemers","year":"2021","journal-title":"Linear Algebra Its Appl."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/1\/104\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T17:58:20Z","timestamp":1760119100000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/1\/104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,4]]},"references-count":96,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["e25010104"],"URL":"https:\/\/doi.org\/10.3390\/e25010104","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,4]]}}}