
<ns0:uwmetadata xmlns:ns0="http://phaidra.univie.ac.at/XML/metadata/V1.0" xmlns:ns1="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0" xmlns:ns10="http://phaidra.univie.ac.at/XML/metadata/provenience/V1.0" xmlns:ns11="http://phaidra.univie.ac.at/XML/metadata/provenience/V1.0/entity" xmlns:ns12="http://phaidra.univie.ac.at/XML/metadata/digitalbook/V1.0" xmlns:ns13="http://phaidra.univie.ac.at/XML/metadata/etheses/V1.0" xmlns:ns2="http://phaidra.univie.ac.at/XML/metadata/extended/V1.0" xmlns:ns3="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0/entity" xmlns:ns4="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0/requirement" xmlns:ns5="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0/educational" xmlns:ns6="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0/annotation" xmlns:ns7="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0/classification" xmlns:ns8="http://phaidra.univie.ac.at/XML/metadata/lom/V1.0/organization" xmlns:ns9="http://phaidra.univie.ac.at/XML/metadata/histkult/V1.0">
  <ns1:general>
    <ns1:identifier>o:28907</ns1:identifier>
    <ns1:title language="en">Some Spectral Characterizations of Equienergetic Regular Graphs and Their Complements</ns1:title>
    <ns1:language>en</ns1:language>
    <ns1:description language="en">Abstract:
The energy E(G) of a graph G is defined as 
E(G) = ∑|λi(G)|, where λi(G),for i = 1, 2, . . . , n, are the adjacency eigenvalues of G. Two graphs with the same number of vertices are said to be equienergetic if they have the same energy. The
spectral distance σ(G1, G2) of two non-isomorphic graphs G1 and G2 of order n, is
σ(G1, G2) = ∑ |λi(G1) − λi(G2)|. 
In [H. S. Ramane, B. Parvathalu, D. D. Patil,
K. Ashoka, Graphs Equienergetic with Their Complements, MATCH Commun. Math. Comput. Chem. 82 (2019) 471–480], the authors asked about spectral properties of graphs which are equienergetic with their complements. Using spectral distances of graphs, we give a necessary and sufficient condition for a regular graph
to have the energy equal to the energy of its complement. Based on this result,
strongly regular graphs equienergetic with their complements are characterized. A spectral property that two equienergetic regular graphs should possess in order for their complements to have equal energies is stated. Equienergetic regular graphs with respect to some graph operations are considered by spectral means, as well.
</ns1:description>
    <ns1:keyword language="en">Keywords: Graph spectrum, equienergetic graphs, regular graphs</ns1:keyword>
    <ns2:identifiers>
      <ns2:resource>1552101</ns2:resource>
      <ns2:identifier>0340-6253</ns2:identifier>
    </ns2:identifiers>
  </ns1:general>
  <ns1:lifecycle>
    <ns1:upload_date>2023-04-24T08:50:39.385Z</ns1:upload_date>
    <ns1:status>44</ns1:status>
    <ns2:peer_reviewed>no</ns2:peer_reviewed>
    <ns1:contribute seq="0">
      <ns1:role>46</ns1:role>
      <ns1:entity seq="0">
        <ns3:firstname>Irena M.</ns3:firstname>
        <ns3:lastname>Jovanović</ns3:lastname>
        <ns3:orcid>0000-0003-0819-7111 </ns3:orcid>
      </ns1:entity>
      <ns1:entity seq="1">
        <ns3:firstname>Emir</ns3:firstname>
        <ns3:lastname>Zogić</ns3:lastname>
        <ns3:institution>Državni univerzitet u Novom Pazaru</ns3:institution>
        <ns3:type>person</ns3:type>
        <ns3:orcid>0000-0002-1355-3785 </ns3:orcid>
      </ns1:entity>
    </ns1:contribute>
  </ns1:lifecycle>
  <ns1:technical>
    <ns1:format>application/pdf</ns1:format>
    <ns1:size>407611</ns1:size>
    <ns1:location>https://phaidrabg.bg.ac.rs/o:28907</ns1:location>
  </ns1:technical>
  <ns1:rights>
    <ns1:cost>no</ns1:cost>
    <ns1:copyright>yes</ns1:copyright>
    <ns1:license>1</ns1:license>
  </ns1:rights>
  <ns1:classification>
    <ns1:purpose>70</ns1:purpose>
  </ns1:classification>
  <ns1:organization>
    <ns8:hoschtyp>92000001</ns8:hoschtyp>
    <ns8:orgassignment>
      <ns8:faculty>20A01</ns8:faculty>
    </ns8:orgassignment>
  </ns1:organization>
  <ns12:digitalbook>
    <ns12:name_magazine language="en">MATCH Communications in Mathematical and in Computer Chemistry</ns12:name_magazine>
    <ns12:volume>86</ns12:volume>
    <ns12:booklet>3</ns12:booklet>
    <ns12:from_page>559</ns12:from_page>
    <ns12:to_page>575</ns12:to_page>
    <ns12:releaseyear>2021</ns12:releaseyear>
  </ns12:digitalbook>
</ns0:uwmetadata>
