• Title of article

    Universal maximal packing functions of graphs Original Research Article

  • Author/Authors

    E.J. Cockayne، نويسنده , , O. Favaron، نويسنده , , C.M. Mynhardt، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1996
  • Pages
    12
  • From page
    57
  • To page
    68
  • Abstract
    A packing function of a graph G = (V, E) is a function ƒ: V → [0,1] such that for each v ϵ V, Σu ϵ N [v] ƒ (u) ⩽ 1 (where N [v] denotes the closed neighbourhood of vertex v). We consider the existence of universal maximal packing functions, i.e. maximal packing functions (MPFs) whose convex combinations with all other MPFs are themselves MPFs.
  • Journal title
    Discrete Mathematics
  • Serial Year
    1996
  • Journal title
    Discrete Mathematics
  • Record number

    943967

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=943967