Packing and covering constants for certain families of trees. I

DOI10.1002/jgt.3190010211zbMath0391.05018OpenAlexW1988178602MaRDI QIDQ4172068

A. Meir, John W. Moon

Publication date: 1977

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190010211

zbMATH Keywords

TreesCovering NumberPacking and CoveringPacking Number

Mathematics Subject Classification ID

Trees (05C05)

Related Items

Some asymptotic results useful in enumeration problems ⋮ Packing and Covering Constants for Certain Families of Trees. II ⋮ On the independence number of some random trees ⋮ The outer-distance of nodes in random trees ⋮ Path node-covering constants for certain families of trees ⋮ Hereditarily finite sets and identity trees ⋮ Normal convergence problem? Two moments and a recurrence may be the clues ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters

Cites Work

• Relations between packing and covering numbers of a tree