𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Universal maximal packing functions of graphs

✍ Scribed by E.J. Cockayne; O. Favaron; C.M. Mynhardt

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
502 KB
Volume
159
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

A packing function

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.

πŸ“œ SIMILAR VOLUMES

Packings and perfect path double covers
Packings and perfect path double covers of maximal planar graphs
✍ Karen Seyffarth πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 817 KB

Seyffarth, K., Packings and perfect path double covers of maximal planar graphs, Discrete Mathematics 117 (1993) 1833195. A maximal planar graph is a simple planar graph in which every face is a triangle, and a perfect packing of such a graph by 2-cliques and facial triangles corresponds to a parti

Universal circuit matrix for adjacency g
Universal circuit matrix for adjacency graphs of feedback functions
✍ Jerzy Ε»urawiecki πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 267 KB

We define the class of undirected graphs associated with the feedback functions. Next, we construct a mapping which transforms a given feedback function into the circuit matrix of the corresponding graph. This mapping establishes some linear dependences between the nonlinear feedback functions, so i

Interior graphs of maximal outerplane gr
Interior graphs of maximal outerplane graphs
✍ Sandra M Hedetniemi; Andrzej Proskurowski; Maciej M SysΕ‚o πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 631 KB
Centers of maximal outerplanar graphs
Centers of maximal outerplanar graphs
✍ Andrzej Proskurowski πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 178 KB

## Abstract The center of a graph is defined to be the subgraph induced by the set of vertices that have minimum eccentricities (i.e., minimum distance to the most distant vertices). It is shown that only seven graphs can be centers of maximal outerplanar graphs.