Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Graphs with Unique Maximum Packing of Closed Neighborhoods

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
Read Online Read More Add to Saved list
  • Additional Information
    • Publication Information:
      University of Zielona Góra, 2022.
    • Publication Date:
      2022
    • Collection:
      LCC:Mathematics
    • Abstract:
      A packing of a graph G is a subset P of the vertex set of G such that the closed neighborhoods of any two distinct vertices of P do not intersect. We study graphs with a unique packing of the maximum cardinality. We present several general properties for such graphs. These properties are used to characterize the trees with a unique maximum packing. Two characterizations are presented where one of them is inductive based on five operations.
    • File Description:
      electronic resource
    • ISSN:
      2083-5892
    • Relation:
      https://doaj.org/toc/2083-5892
    • Accession Number:
      10.7151/dmgt.2304
    • Accession Number:
      edsdoj.491e0f9804954081aabd546e6535a2f0