Maximal buttonings of trees

DOI10.7151/DMGT.1716MaRDI QIDQ2450135zbMATH OpenOpenAlexFDO

Authors Ian Short

Publication date 16 May 2014

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.1716

zbMATH Keywords

centroidgraph metricwalkWiener distance

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Maximal buttonings of non-tree graphs
• On the tree packing problem
• scientific article; zbMATH DE number 910707
• A Note on Independent Sets in Trees
• Maximin Center of Pendant Vertices in a Tree Network

Cites work

• Extremal values for ratios of distances in trees
• scientific article; zbMATH DE number 975398 (Why is no real title available?)
• Wiener index of trees: Theory and applications

Cited in

(1)

• Maximal buttonings of non-tree graphs

This page was built for publication: Maximal buttonings of trees

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