
<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:2616</ns1:identifier>
    <ns1:title language="sr">Neki doprinosi spektralnoj teoriji grafova</ns1:title>
    <ns2:alt_title language="sr">Some contributions to spectral graph theory : doctoral dissertation</ns2:alt_title>
    <ns1:language>sr</ns1:language>
    <ns1:description language="sr">The doctoral dissertation deals with solving three concrete scientificproblems from the field of spectral graph theory. Firstof all, let a nut graph represent a nontrivial simple graph whoseadjacency matrix has a one dimensional null space all of whosenonzero members contain no zero elements. The first resolvedscientific problem is the circulant nut graph existence problemwhich is connected to determining all the pairs (n, d), n EN, d E N0 for which there exists a d-regular circulant nut graphof order n. Furthermore, let a balanced tree be a rooted tree allof whose vertices from the same level have an equal number ofchildren. Also, for any d, k E N, d &gt; 2, let the Bethe tree Bd, krepresent a balanced tree with k levels such that all of its verticesoutside the last level have exactly d - 1 children, and letthe dendrimer Dd, k be a balanced tree with k levels such thatall of its vertices outside the last level are of degree d. The secondscientific problem that the dissertation deals with is thespectral analysis of balanced trees with a special focus on computingthe energy of Bethe trees and approximating the energyof dendrimers. Finally, the goal of the third part of the doctoraldissertation is to determine the energy of the newly introducedmartini graphs for the purpose of disproving a conjecture previouslydisclosed by Akbari et al.</ns1:description>
    <ns1:description language="sr">Biografija autora: list 128Bibliografija: listovi 114-119  Datum odbrane: 1.7.2024. Graph Theory</ns1:description>
    <ns2:identifiers>
      <ns2:resource>91552100</ns2:resource>
      <ns2:identifier>138833929</ns2:identifier>
    </ns2:identifiers>
    <ns2:identifiers>
      <ns2:resource>91552101</ns2:resource>
      <ns2:identifier>8704</ns2:identifier>
    </ns2:identifiers>
  </ns1:general>
  <ns1:lifecycle>
    <ns1:upload_date>2024-09-03T15:59:46.053Z</ns1:upload_date>
    <ns1:status>45</ns1:status>
    <ns2:peer_reviewed>no</ns2:peer_reviewed>
    <ns1:contribute seq="0">
      <ns1:role>46</ns1:role>
      <ns1:entity seq="0">
        <ns3:firstname> Ivan G., 1996-</ns3:firstname>
        <ns3:lastname>Damnjanović</ns3:lastname>
        <ns3:conor>110969609</ns3:conor>
      </ns1:entity>
      <ns1:date>2023</ns1:date>
    </ns1:contribute>
    <ns1:contribute seq="1">
      <ns1:role>63</ns1:role>
      <ns1:ext_role>mentor</ns1:ext_role>
      <ns1:entity seq="0">
        <ns3:firstname> Emina I., 1958-</ns3:firstname>
        <ns3:lastname>Milovanović</ns3:lastname>
        <ns3:conor>13796455</ns3:conor>
      </ns1:entity>
      <ns1:date>2023</ns1:date>
    </ns1:contribute>
    <ns1:contribute seq="2">
      <ns1:role>63</ns1:role>
      <ns1:ext_role>član komisije</ns1:ext_role>
      <ns1:entity seq="0">
        <ns3:firstname> Ivan, 1965-</ns3:firstname>
        <ns3:lastname>Milentijević</ns3:lastname>
        <ns3:conor>6254439</ns3:conor>
      </ns1:entity>
      <ns1:date>2023</ns1:date>
    </ns1:contribute>
    <ns1:contribute seq="3">
      <ns1:role>63</ns1:role>
      <ns1:ext_role>član komisije</ns1:ext_role>
      <ns1:entity seq="0">
        <ns3:firstname> Dragan, 1974-</ns3:firstname>
        <ns3:lastname>Stevanović</ns3:lastname>
        <ns3:conor>13819751</ns3:conor>
      </ns1:entity>
      <ns1:date>2023</ns1:date>
    </ns1:contribute>
    <ns1:contribute seq="4">
      <ns1:role>63</ns1:role>
      <ns1:ext_role>član komisije</ns1:ext_role>
      <ns1:entity seq="0">
        <ns3:firstname> Marjan, 1977-</ns3:firstname>
        <ns3:lastname>Matejić</ns3:lastname>
        <ns3:conor>5909351</ns3:conor>
      </ns1:entity>
      <ns1:date>2023</ns1:date>
    </ns1:contribute>
    <ns1:contribute seq="5">
      <ns1:role>63</ns1:role>
      <ns1:ext_role>član komisije</ns1:ext_role>
      <ns1:entity seq="0">
        <ns3:firstname> Vladimir, 1977-</ns3:firstname>
        <ns3:lastname>Ćirić</ns3:lastname>
        <ns3:conor>11384679</ns3:conor>
      </ns1:entity>
      <ns1:date>2023</ns1:date>
    </ns1:contribute>
  </ns1:lifecycle>
  <ns1:technical>
    <ns1:format>128 listova</ns1:format>
    <ns1:size>1513732</ns1:size>
    <ns1:location>http://phaidrani.ni.ac.rs/o:2616</ns1:location>
  </ns1:technical>
  <ns1:rights>
    <ns1:cost>no</ns1:cost>
    <ns1:copyright>yes</ns1:copyright>
    <ns1:license>12</ns1:license>
  </ns1:rights>
  <ns1:annotation>
    <ns6:annotations>
      <ns6:date>2024-09-03T15:59:46.320Z</ns6:date>
    </ns6:annotations>
  </ns1:annotation>
  <ns1:classification>
    <ns1:purpose>70</ns1:purpose>
    <ns7:keyword language="sr" seq="1">spektar, karakteristični polinom, energija grafa, matičan graf, cirkulantan graf, ciklotomičan polinom, balansirano stablo, Bete stablo, dendrimer, martini graf</ns7:keyword>
    <ns7:keyword language="sr" seq="1">spectrum, characteristic polynomial, graph energy, nut graph,circulant graph, cyclotomic polynomial, balanced tree, Bethetree, dendrimer, martini graph</ns7:keyword>
    <ns7:keyword language="sr" seq="1">(510.22+519.17):(510.6+004.42)(043.3)</ns7:keyword>
    <ns7:keyword language="sr" seq="1">P110</ns7:keyword>
  </ns1:classification>
  <ns1:organization>
    <ns8:hoschtyp>1738</ns8:hoschtyp>
    <ns8:orgassignment>
      <ns8:faculty>18A03</ns8:faculty>
      <ns8:department>18A0304</ns8:department>
    </ns8:orgassignment>
  </ns1:organization>
  <ns12:digitalbook>
    <ns12:releaseyear>2023</ns12:releaseyear>
  </ns12:digitalbook>
</ns0:uwmetadata>
