Packing constants in graphs and connectivity

DOI10.1016/0012-365X(93)E0135-QMaRDI QIDQ1343800zbMATH OpenOpenAlexWikidataFDO

Authors Peter Brass

Publication date 9 May 1995

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)e0135-q

zbMATH Keywords

distanceboundconnectivitypacking constants

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)

Recommendations

• Order and radius of \((2k-1)\)-connected graphs
• Packing in regular graphs
• Packing smaller graphs into a graph
• Average distance and generalised packing in graphs
• Radius of \((2k-1)\)-connected graphs

Cites work

• scientific article; zbMATH DE number 3427399 (Why is no real title available?)
• A generalisation of the diameter of a graph

Cited in

(2)

• The packing number and Laplacian spectrum of a graph
• On graphs which contain each tree of given size

This page was built for publication: Packing constants in graphs and connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1343800)