{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T22:10:10Z","timestamp":1730412610872,"version":"3.28.0"},"reference-count":16,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["MATH"],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:p xml:lang=\"fr\">&lt;abstract&gt;&lt;p&gt;For a $ \\nu $-vertex connected graph $ \\Gamma $, we consider the reciprocal distance Laplacian matrix defined as $ RD^L(\\Gamma) = RT(\\Gamma)-RD(\\Gamma) $, i.e., $ RD^L(\\Gamma) $ is the difference between the diagonal matrix of the reciprocal distance degrees $ RT(\\Gamma) $ and the Harary matrix $ RD(\\Gamma) $. In this article, we determine the graphs with exactly two distinct reciprocal distance Laplacian eigenvalues.We completely characterize the graph classes with a $ RD^L $ eigenvalue of multiplicity $ \\nu-2 $. Moreover, we characterize families of graphs with reciprocal distance Laplacian eigenvalue whose multiplicity is $ \\nu-3 $.&lt;\/p&gt;&lt;\/abstract&gt;<\/jats:p>","DOI":"10.3934\/math.20231485","type":"journal-article","created":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T10:38:19Z","timestamp":1698316699000},"page":"29008-29016","source":"Crossref","is-referenced-by-count":0,"title":["On graphs with a few distinct reciprocal distance Laplacian eigenvalues"],"prefix":"10.3934","volume":"8","author":[{"given":"Milica","family":"An\u0111eli\u0107","sequence":"first","affiliation":[{"name":"Department of Mathematics, Kuwait University, Al-Shadadiyah, Kuwait"}]},{"given":"Saleem","family":"Khan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India"}]},{"given":"S.","family":"Pirzada","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Kashmir, Srinagar, Kashmir, India"}]}],"member":"2321","reference":[{"key":"key-10.3934\/math.20231485-1","doi-asserted-by":"publisher","unstructured":"D. Plav\u0161i\u0107, S. Nikoli\u0107, N. Trinajsti\u0107, Z. Mihali\u0107, On the Harary index for the characterization of chemical graphs, <i>J. Math. Chem.<\/i>, <b>12<\/b> (1993), 235\u2013250. https:\/\/doi.org\/10.1007\/BF01164638","DOI":"10.1007\/BF01164638"},{"key":"key-10.3934\/math.20231485-2","doi-asserted-by":"publisher","unstructured":"K. C. Das, Maximum eigenvalue of the reciprocal distance matrix, <i>J. Math. Chem.<\/i>, <b>47<\/b> (2010), 21\u201328. https:\/\/doi.org\/10.1007\/s10910-009-9529-1","DOI":"10.1007\/s10910-009-9529-1"},{"key":"key-10.3934\/math.20231485-3","doi-asserted-by":"publisher","unstructured":"F. Huang, X. Li, S. Wang, On graphs with maximum Harary spectral radius, <i>Appl. Math. Comput.<\/i>, <b>266<\/b> (2014), 937\u2013945. https:\/\/doi.org\/10.1016\/j.amc.2015.05.146","DOI":"10.1016\/j.amc.2015.05.146"},{"key":"key-10.3934\/math.20231485-4","doi-asserted-by":"publisher","unstructured":"B. Zhou, N. Trinajsti\u0107, Maximum eigenvalues of the reciprocal distance matrix and the reverse Wiener matrix, <i>Int. J. Quantum Chem.<\/i>, <b>108<\/b> (2008), 858\u2013864. https:\/\/doi.org\/10.1002\/qua.21558","DOI":"10.1002\/qua.21558"},{"key":"key-10.3934\/math.20231485-5","doi-asserted-by":"publisher","unstructured":"R. Bapat, S. K. Panda, The spectral radius of the Reciprocal distance Laplacian matrix of a graph, <i>B. Iran. Math. Soc.<\/i>, <b>44<\/b> (2018), 1211\u20131216. https:\/\/doi.org\/10.1007\/s41980-018-0084-z","DOI":"10.1007\/s41980-018-0084-z"},{"key":"key-10.3934\/math.20231485-6","doi-asserted-by":"crossref","unstructured":"S. Pirzada, S. Khan, On the distribution of eigenvalues of the reciprocal distance Laplacian matrix of graphs, <i>Filomat<\/i>, <b>37<\/b> (2023), 7973\u20137980.","DOI":"10.2298\/FIL2323973P"},{"key":"key-10.3934\/math.20231485-7","doi-asserted-by":"publisher","unstructured":"L. Medina, M. Trigo, Upper bounds and lower bounds for the spectral radius of reciprocal distance, reciprocal distance Laplacian and reciprocal distance signless Laplacian matrices, <i>Linear Algebra Appl.<\/i>, <b>609<\/b> (2021), 386\u2013412. https:\/\/doi.org\/10.1016\/j.laa.2020.09.024","DOI":"10.1016\/j.laa.2020.09.024"},{"key":"key-10.3934\/math.20231485-8","doi-asserted-by":"publisher","unstructured":"L. Medina, M. Trigo, Bounds on the reciprocal distance energy and reciprocal distance Laplacian energies of a graph, <i>Linear Multilinear A.<\/i>, <b>70<\/b> (2022), 3097\u20133118. https:\/\/doi.org\/10.1080\/03081087.2020.1825607","DOI":"10.1080\/03081087.2020.1825607"},{"key":"key-10.3934\/math.20231485-9","doi-asserted-by":"publisher","unstructured":"M. Trigo, On Hararay energy and reciprocal distance Laplacian energies, <i>J. Phys. Conf. Ser.<\/i>, <b>2090<\/b> (2021), 012102. https:\/\/doi.org\/10.1088\/1742-6596\/2090\/1\/012102","DOI":"10.1088\/1742-6596\/2090\/1\/012102"},{"key":"key-10.3934\/math.20231485-10","unstructured":"S. Pirzada, <i>An introduction to graph theory<\/i>, Hyderabad: Universities Press, 2012."},{"key":"key-10.3934\/math.20231485-11","doi-asserted-by":"crossref","unstructured":"D. Corneil, H. Lerchs, L. Burlingham, Complement reducible graphs, <i>Discrete Appl. Math.<\/i>, <b>3<\/b> (1981), 163\u2013174. <ext-link ext-link-type=\"uri\" xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/doi.org\/10.1016\/0166-218X(81)90013-5\">https:\/\/doi.org\/10.1016\/0166-218X(81)90013-5<\/ext-link>","DOI":"10.1016\/0166-218X(81)90013-5"},{"key":"key-10.3934\/math.20231485-12","doi-asserted-by":"publisher","unstructured":"R. Fernandes, M. Aguieiras, A. Freitas, C. M. Silva, R. R. D. Vecchio, Multiplicities of distance Laplacian eigenvalues and forbidden subgraphs, <i>Linear Algebra Appl.<\/i>, <b>541<\/b> (2018), 81\u201393. https:\/\/doi.org\/10.1016\/j.laa.2017.11.031","DOI":"10.1016\/j.laa.2017.11.031"},{"key":"key-10.3934\/math.20231485-13","doi-asserted-by":"publisher","unstructured":"K. C. Das, A sharp upper bound for the number of spanning trees of a graph, <i>Graphs Combin.<\/i>, <b>23<\/b> (2007), 625\u2013632. https:\/\/doi.org\/10.1007\/s00373-007-0758-4","DOI":"10.1007\/s00373-007-0758-4"},{"key":"key-10.3934\/math.20231485-14","doi-asserted-by":"publisher","unstructured":"R. Merris, Laplacian eigenvalues of graphs: A survey, <i>Linear Algebra Appl.<\/i>, <b>197\u2013198<\/b> (1994), 143\u2013176. https:\/\/doi.org\/10.1016\/0024-3795(94)90486-3","DOI":"10.1016\/0024-3795(94)90486-3"},{"key":"key-10.3934\/math.20231485-15","doi-asserted-by":"publisher","unstructured":"A. Mohammadian, B. T. Rezaie, Graphs with four distinct Laplacian eigenvalues, <i>J. Algebraic Combin.<\/i>, <b>34<\/b> (2011), 671\u2013682. https:\/\/doi.org\/10.1007\/s10801-011-0287-3","DOI":"10.1007\/s10801-011-0287-3"},{"key":"key-10.3934\/math.20231485-16","doi-asserted-by":"publisher","unstructured":"P. Rowlinson, Z. Stani\u0107, Signed graphs with three eigenvalues: Biregularity and beyond, <i>Linear Algebra Appl.<\/i>, <b>621<\/b> (2021), 272\u2013295. https:\/\/doi.org\/10.1016\/j.laa.2021.03.018","DOI":"10.1016\/j.laa.2021.03.018"}],"container-title":["AIMS Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/www.aimspress.com\/article\/doi\/10.3934\/math.20231485?viewType=html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T21:37:34Z","timestamp":1730410654000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.aimspress.com\/article\/doi\/10.3934\/math.20231485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":16,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.3934\/math.20231485","relation":{},"ISSN":["2473-6988"],"issn-type":[{"type":"print","value":"2473-6988"}],"subject":[],"published":{"date-parts":[[2023]]}}}