• DocumentCode
    143523
  • Title

    Homometric sets in diameter-two and outerplanar graphs

  • Author

    Mitrovic, Sindi

  • Author_Institution
    EDIC, Ecole Polytech. Fed. de Lausanne, Lausanne, Switzerland
  • fYear
    2014
  • fDate
    13-16 April 2014
  • Firstpage
    187
  • Lastpage
    192
  • Abstract
    We improve the best previously-known lower bound on the size of largest homometric sets in sparse diameter-two graphs. Along with the proof, we provide a method for constructing the desired homometric sets. We also study outerplanar graphs and show how to construct homometric sets in a given outerplanar graph of the size at least clogn, where n is the number of vertices in the graph, and c a positive fixed constant.
  • Keywords
    graph theory; set theory; homometric sets; outerplanar graphs; sparse diameter-two graph; Conferences; Crystallography; Electronic mail; Equations; History; X-ray diffraction;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Mediterranean Electrotechnical Conference (MELECON), 2014 17th IEEE
  • Conference_Location
    Beirut
  • Type

    conf

  • DOI
    10.1109/MELCON.2014.6820529
  • Filename
    6820529
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=143523